./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product49_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_product49_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 5f66ecd5f6aef5b29bc80dee4a57cabf0f421223 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:28,804 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:46:28,806 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:46:28,824 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:46:28,824 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:46:28,826 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:46:28,828 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:46:28,830 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:46:28,833 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:46:28,838 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:46:28,840 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:46:28,841 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:46:28,842 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:46:28,843 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:46:28,846 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:46:28,847 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:46:28,848 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:46:28,856 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:46:28,860 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:46:28,865 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:46:28,866 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:46:28,867 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:46:28,872 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:46:28,872 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:46:28,873 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:46:28,873 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:46:28,874 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:46:28,880 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:46:28,881 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:46:28,883 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:46:28,883 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:46:28,884 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:46:28,884 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:46:28,884 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:46:28,885 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:46:28,888 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:46:28,891 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:28,917 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:46:28,918 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:46:28,919 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:46:28,919 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:46:28,919 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:46:28,920 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:46:28,920 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:46:28,921 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:46:28,921 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:46:28,921 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:46:28,921 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:46:28,921 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:46:28,921 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:46:28,922 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:46:28,923 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:46:28,923 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:46:28,923 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:46:28,923 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:46:28,923 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:46:28,923 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:46:28,924 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:46:28,924 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:46:28,924 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:46:28,924 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:46:28,924 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:46:28,924 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:46:28,925 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:46:28,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:46:28,926 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 -> 5f66ecd5f6aef5b29bc80dee4a57cabf0f421223 [2019-01-12 14:46:28,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:46:28,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:46:28,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:46:28,980 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:46:28,981 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:46:28,981 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product49_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:29,054 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b77551eb/36387a3971dc47398727f4483b8d7369/FLAGaa592dc29 [2019-01-12 14:46:29,661 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:46:29,662 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product49_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:29,678 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b77551eb/36387a3971dc47398727f4483b8d7369/FLAGaa592dc29 [2019-01-12 14:46:29,894 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b77551eb/36387a3971dc47398727f4483b8d7369 [2019-01-12 14:46:29,898 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:46:29,900 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:46:29,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:46:29,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:46:29,905 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:46:29,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:46:29" (1/1) ... [2019-01-12 14:46:29,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672937de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:29, skipping insertion in model container [2019-01-12 14:46:29,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:46:29" (1/1) ... [2019-01-12 14:46:29,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:46:29,985 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:46:30,337 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:46:30,357 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:46:30,462 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:46:30,580 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:46:30,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:30 WrapperNode [2019-01-12 14:46:30,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:46:30,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:46:30,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:46:30,583 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:46:30,593 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:30" (1/1) ... [2019-01-12 14:46:30,613 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:30" (1/1) ... [2019-01-12 14:46:30,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:46:30,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:46:30,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:46:30,663 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:46:30,670 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:30" (1/1) ... [2019-01-12 14:46:30,671 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:30" (1/1) ... [2019-01-12 14:46:30,676 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:30" (1/1) ... [2019-01-12 14:46:30,676 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:30" (1/1) ... [2019-01-12 14:46:30,689 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:30" (1/1) ... [2019-01-12 14:46:30,699 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:30" (1/1) ... [2019-01-12 14:46:30,702 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:30" (1/1) ... [2019-01-12 14:46:30,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:46:30,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:46:30,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:46:30,708 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:46:30,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:30" (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:30,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:46:30,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:46:30,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:46:30,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:46:32,388 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:46:32,389 INFO L286 CfgBuilder]: Removed 156 assue(true) statements. [2019-01-12 14:46:32,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:32 BoogieIcfgContainer [2019-01-12 14:46:32,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:46:32,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:46:32,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:46:32,395 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:46:32,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:46:29" (1/3) ... [2019-01-12 14:46:32,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae7cf0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:46:32, skipping insertion in model container [2019-01-12 14:46:32,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:30" (2/3) ... [2019-01-12 14:46:32,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae7cf0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:46:32, skipping insertion in model container [2019-01-12 14:46:32,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:32" (3/3) ... [2019-01-12 14:46:32,399 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product49_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:32,407 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:46:32,414 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:46:32,429 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:46:32,461 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:46:32,461 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:46:32,462 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:46:32,462 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:46:32,462 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:46:32,462 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:46:32,462 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:46:32,463 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:46:32,463 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:46:32,485 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2019-01-12 14:46:32,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:46:32,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:32,497 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:32,500 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:32,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:32,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1641629540, now seen corresponding path program 1 times [2019-01-12 14:46:32,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:32,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:32,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:32,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:32,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:32,737 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:32,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:32,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:32,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:46:32,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:46:32,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:46:32,756 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 2 states. [2019-01-12 14:46:32,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:32,786 INFO L93 Difference]: Finished difference Result 228 states and 347 transitions. [2019-01-12 14:46:32,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:46:32,788 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:46:32,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:32,801 INFO L225 Difference]: With dead ends: 228 [2019-01-12 14:46:32,801 INFO L226 Difference]: Without dead ends: 113 [2019-01-12 14:46:32,804 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:32,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-12 14:46:32,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-12 14:46:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-12 14:46:32,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2019-01-12 14:46:32,852 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 16 [2019-01-12 14:46:32,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:32,852 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2019-01-12 14:46:32,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:46:32,853 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2019-01-12 14:46:32,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:46:32,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:32,854 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:32,854 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:32,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:32,855 INFO L82 PathProgramCache]: Analyzing trace with hash 594872643, now seen corresponding path program 1 times [2019-01-12 14:46:32,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:32,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:32,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:32,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:32,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:33,055 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:33,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:33,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:46:33,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:33,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:33,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:33,060 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand 3 states. [2019-01-12 14:46:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:33,100 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2019-01-12 14:46:33,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:33,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:46:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:33,106 INFO L225 Difference]: With dead ends: 113 [2019-01-12 14:46:33,106 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 14:46:33,110 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:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 14:46:33,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-12 14:46:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 14:46:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2019-01-12 14:46:33,120 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2019-01-12 14:46:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:33,120 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2019-01-12 14:46:33,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2019-01-12 14:46:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:46:33,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:33,122 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:33,122 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:33,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:33,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1404483435, now seen corresponding path program 1 times [2019-01-12 14:46:33,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:33,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:33,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:33,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:33,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:33,335 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:33,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:33,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:46:33,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:46:33,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:46:33,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:46:33,337 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 6 states. [2019-01-12 14:46:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:33,446 INFO L93 Difference]: Finished difference Result 88 states and 130 transitions. [2019-01-12 14:46:33,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:46:33,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-01-12 14:46:33,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:33,449 INFO L225 Difference]: With dead ends: 88 [2019-01-12 14:46:33,449 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 14:46:33,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:46:33,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 14:46:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-12 14:46:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 14:46:33,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2019-01-12 14:46:33,458 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 22 [2019-01-12 14:46:33,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:33,458 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2019-01-12 14:46:33,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:46:33,458 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2019-01-12 14:46:33,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:46:33,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:33,459 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:33,460 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:33,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:33,460 INFO L82 PathProgramCache]: Analyzing trace with hash -764351347, now seen corresponding path program 1 times [2019-01-12 14:46:33,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:33,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:33,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:33,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:33,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:33,565 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:33,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:33,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:33,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:33,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:33,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:33,567 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand 3 states. [2019-01-12 14:46:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:33,660 INFO L93 Difference]: Finished difference Result 109 states and 158 transitions. [2019-01-12 14:46:33,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:33,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-12 14:46:33,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:33,663 INFO L225 Difference]: With dead ends: 109 [2019-01-12 14:46:33,663 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 14:46:33,664 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:33,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 14:46:33,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-01-12 14:46:33,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-12 14:46:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 93 transitions. [2019-01-12 14:46:33,674 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 93 transitions. Word has length 24 [2019-01-12 14:46:33,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:33,675 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 93 transitions. [2019-01-12 14:46:33,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:33,675 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 93 transitions. [2019-01-12 14:46:33,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:46:33,676 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:33,676 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] [2019-01-12 14:46:33,676 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:33,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:33,677 INFO L82 PathProgramCache]: Analyzing trace with hash -805303330, now seen corresponding path program 1 times [2019-01-12 14:46:33,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:33,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:33,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:33,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:33,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:33,994 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:33,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:33,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:46:33,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:33,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:33,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:33,997 INFO L87 Difference]: Start difference. First operand 66 states and 93 transitions. Second operand 5 states. [2019-01-12 14:46:34,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:34,260 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2019-01-12 14:46:34,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:46:34,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-12 14:46:34,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:34,263 INFO L225 Difference]: With dead ends: 175 [2019-01-12 14:46:34,263 INFO L226 Difference]: Without dead ends: 115 [2019-01-12 14:46:34,264 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:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-12 14:46:34,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2019-01-12 14:46:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-12 14:46:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2019-01-12 14:46:34,277 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 99 transitions. Word has length 30 [2019-01-12 14:46:34,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:34,277 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 99 transitions. [2019-01-12 14:46:34,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:34,277 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2019-01-12 14:46:34,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:46:34,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:34,280 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] [2019-01-12 14:46:34,280 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:34,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:34,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1857207713, now seen corresponding path program 1 times [2019-01-12 14:46:34,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:34,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:34,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:34,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:34,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:34,617 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:34,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:34,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:34,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:34,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:34,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:34,620 INFO L87 Difference]: Start difference. First operand 72 states and 99 transitions. Second operand 5 states. [2019-01-12 14:46:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:35,341 INFO L93 Difference]: Finished difference Result 204 states and 283 transitions. [2019-01-12 14:46:35,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:46:35,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-12 14:46:35,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:35,344 INFO L225 Difference]: With dead ends: 204 [2019-01-12 14:46:35,344 INFO L226 Difference]: Without dead ends: 202 [2019-01-12 14:46:35,346 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:35,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-01-12 14:46:35,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 72. [2019-01-12 14:46:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-12 14:46:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2019-01-12 14:46:35,375 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 30 [2019-01-12 14:46:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:35,375 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2019-01-12 14:46:35,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2019-01-12 14:46:35,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:46:35,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:35,382 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] [2019-01-12 14:46:35,382 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:35,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:35,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1198330340, now seen corresponding path program 1 times [2019-01-12 14:46:35,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:35,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:35,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:35,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:35,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:35,529 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:35,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:35,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:46:35,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:46:35,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:46:35,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:46:35,531 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand 6 states. [2019-01-12 14:46:35,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:35,922 INFO L93 Difference]: Finished difference Result 188 states and 256 transitions. [2019-01-12 14:46:35,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:46:35,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-01-12 14:46:35,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:35,925 INFO L225 Difference]: With dead ends: 188 [2019-01-12 14:46:35,926 INFO L226 Difference]: Without dead ends: 122 [2019-01-12 14:46:35,929 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:35,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-12 14:46:35,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 76. [2019-01-12 14:46:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-12 14:46:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2019-01-12 14:46:35,953 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 30 [2019-01-12 14:46:35,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:35,954 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2019-01-12 14:46:35,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:46:35,954 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2019-01-12 14:46:35,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:46:35,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:35,955 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] [2019-01-12 14:46:35,955 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:35,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:35,959 INFO L82 PathProgramCache]: Analyzing trace with hash -940164902, now seen corresponding path program 1 times [2019-01-12 14:46:35,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:35,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:35,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:35,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:35,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:36,061 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:36,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:36,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:36,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:36,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:36,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:36,064 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 3 states. [2019-01-12 14:46:36,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:36,237 INFO L93 Difference]: Finished difference Result 172 states and 232 transitions. [2019-01-12 14:46:36,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:36,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-01-12 14:46:36,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:36,240 INFO L225 Difference]: With dead ends: 172 [2019-01-12 14:46:36,240 INFO L226 Difference]: Without dead ends: 102 [2019-01-12 14:46:36,242 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:36,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-12 14:46:36,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-12 14:46:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-12 14:46:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2019-01-12 14:46:36,264 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 30 [2019-01-12 14:46:36,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:36,264 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 134 transitions. [2019-01-12 14:46:36,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2019-01-12 14:46:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:46:36,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:36,266 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:36,266 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:36,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:36,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1346986200, now seen corresponding path program 1 times [2019-01-12 14:46:36,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:36,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:36,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:36,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:36,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:36,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:36,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:36,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:36,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:36,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:36,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:36,564 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. Second operand 5 states. [2019-01-12 14:46:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:37,257 INFO L93 Difference]: Finished difference Result 553 states and 737 transitions. [2019-01-12 14:46:37,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:46:37,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:46:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:37,262 INFO L225 Difference]: With dead ends: 553 [2019-01-12 14:46:37,262 INFO L226 Difference]: Without dead ends: 457 [2019-01-12 14:46:37,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:46:37,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-01-12 14:46:37,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 190. [2019-01-12 14:46:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-01-12 14:46:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 248 transitions. [2019-01-12 14:46:37,298 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 248 transitions. Word has length 31 [2019-01-12 14:46:37,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:37,299 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 248 transitions. [2019-01-12 14:46:37,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 248 transitions. [2019-01-12 14:46:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:46:37,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:37,300 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:37,301 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:37,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:37,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1913811026, now seen corresponding path program 1 times [2019-01-12 14:46:37,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:37,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:37,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:37,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:37,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:46:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:46:38,337 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:46:38,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:46:38 BoogieIcfgContainer [2019-01-12 14:46:38,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:46:38,490 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:46:38,491 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:46:38,492 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:46:38,492 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:32" (3/4) ... [2019-01-12 14:46:38,497 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:46:38,623 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:46:38,623 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:46:38,624 INFO L168 Benchmark]: Toolchain (without parser) took 8724.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -65.8 MB). Peak memory consumption was 138.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:38,627 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:46:38,628 INFO L168 Benchmark]: CACSL2BoogieTranslator took 681.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:38,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.52 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:38,629 INFO L168 Benchmark]: Boogie Preprocessor took 44.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:38,629 INFO L168 Benchmark]: RCFGBuilder took 1683.42 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: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:38,632 INFO L168 Benchmark]: TraceAbstraction took 6098.42 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.0 MB). Peak memory consumption was 90.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:38,632 INFO L168 Benchmark]: Witness Printer took 132.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:38,637 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 681.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.52 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1683.42 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: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6098.42 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.0 MB). Peak memory consumption was 90.9 MB. Max. memory is 11.5 GB. * Witness Printer took 132.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 950]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] int cleanupTimeShifts = 4; [L342] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L545] int pumpRunning = 0; [L546] int systemActive = 1; [L843] int waterLevel = 1; [L844] int methaneLevelCritical = 0; [L150] int retValue_acc ; [L151] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L833] int retValue_acc ; [L836] retValue_acc = 1 [L837] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L157] tmp = valid_product() [L159] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L743] int splverifierCounter ; [L744] int tmp ; [L745] int tmp___0 ; [L746] int tmp___1 ; [L747] int tmp___2 ; [L750] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L752] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L754] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L760] tmp = __VERIFIER_nondet_int() [L762] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L861] COND TRUE waterLevel < 2 [L862] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L770] tmp___0 = __VERIFIER_nondet_int() [L772] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L873] COND FALSE !(\read(methaneLevelCritical)) [L876] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L780] tmp___2 = __VERIFIER_nondet_int() [L782] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L552] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L559] COND TRUE \read(systemActive) [L607] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L610] COND FALSE !(\read(pumpRunning)) [L581] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L584] COND TRUE ! pumpRunning [L704] int retValue_acc ; [L705] int tmp ; [L706] int tmp___0 ; [L923] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L926] COND FALSE !(waterLevel < 2) [L930] retValue_acc = 0 [L931] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L710] tmp = isHighWaterSensorDry() [L712] COND FALSE !(\read(tmp)) [L715] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L717] retValue_acc = tmp___0 [L718] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L586] tmp = isHighWaterLevel() [L588] COND TRUE \read(tmp) [L635] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L44] int tmp ; [L45] int tmp___0 ; [L882] int retValue_acc ; [L885] retValue_acc = methaneLevelCritical [L886] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L49] tmp = isMethaneLevelCritical() [L51] COND TRUE \read(tmp) [L659] int retValue_acc ; [L662] retValue_acc = pumpRunning [L663] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L53] tmp___0 = isPumpRunning() [L55] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L950] __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, 117 locations, 3 error locations. UNSAFE Result, 6.0s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 826 SDtfs, 1231 SDslu, 1056 SDs, 0 SdLazy, 148 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 488 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 12174 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...