./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec2_product34_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_spec2_product34_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 f18aab99c70cc7d44332259818cc5069ce850e66 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:56,108 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:46:56,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:46:56,126 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:46:56,126 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:46:56,128 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:46:56,130 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:46:56,132 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:46:56,134 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:46:56,135 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:46:56,138 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:46:56,138 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:46:56,139 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:46:56,142 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:46:56,143 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:46:56,150 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:46:56,151 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:46:56,153 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:46:56,158 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:46:56,160 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:46:56,162 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:46:56,162 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:46:56,167 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:46:56,167 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:46:56,167 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:46:56,170 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:46:56,171 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:46:56,173 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:46:56,173 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:46:56,175 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:46:56,177 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:46:56,178 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:46:56,179 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:46:56,179 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:46:56,180 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:46:56,181 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:46:56,182 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:56,209 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:46:56,210 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:46:56,211 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:46:56,211 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:46:56,212 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:46:56,214 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:46:56,214 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:46:56,214 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:46:56,214 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:46:56,214 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:46:56,215 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:46:56,215 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:46:56,215 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:46:56,215 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:46:56,215 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:46:56,215 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:46:56,216 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:46:56,216 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:46:56,216 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:46:56,216 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:46:56,216 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:46:56,217 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:46:56,218 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:46:56,218 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:46:56,218 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:46:56,218 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:46:56,219 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:46:56,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:46:56,219 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 -> f18aab99c70cc7d44332259818cc5069ce850e66 [2019-01-12 14:46:56,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:46:56,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:46:56,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:46:56,303 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:46:56,304 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:46:56,304 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec2_product34_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:56,352 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f2172b64/f897425e82bd49e78d7ec35095738e25/FLAG897ba3683 [2019-01-12 14:46:56,848 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:46:56,849 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec2_product34_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:56,867 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f2172b64/f897425e82bd49e78d7ec35095738e25/FLAG897ba3683 [2019-01-12 14:46:57,127 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f2172b64/f897425e82bd49e78d7ec35095738e25 [2019-01-12 14:46:57,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:46:57,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:46:57,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:46:57,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:46:57,136 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:46:57,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:46:57" (1/1) ... [2019-01-12 14:46:57,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f9a908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:57, skipping insertion in model container [2019-01-12 14:46:57,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:46:57" (1/1) ... [2019-01-12 14:46:57,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:46:57,196 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:46:57,566 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:46:57,582 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:46:57,795 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:46:57,833 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:46:57,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:57 WrapperNode [2019-01-12 14:46:57,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:46:57,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:46:57,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:46:57,834 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:46:57,844 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:57" (1/1) ... [2019-01-12 14:46:57,863 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:57" (1/1) ... [2019-01-12 14:46:57,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:46:57,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:46:57,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:46:57,920 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:46:57,929 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:57" (1/1) ... [2019-01-12 14:46:57,929 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:57" (1/1) ... [2019-01-12 14:46:57,934 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:57" (1/1) ... [2019-01-12 14:46:57,934 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:57" (1/1) ... [2019-01-12 14:46:57,944 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:57" (1/1) ... [2019-01-12 14:46:57,952 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:57" (1/1) ... [2019-01-12 14:46:57,955 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:57" (1/1) ... [2019-01-12 14:46:57,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:46:57,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:46:57,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:46:57,961 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:46:57,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:57" (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:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:46:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:46:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:46:58,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:46:59,288 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:46:59,289 INFO L286 CfgBuilder]: Removed 100 assue(true) statements. [2019-01-12 14:46:59,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:59 BoogieIcfgContainer [2019-01-12 14:46:59,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:46:59,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:46:59,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:46:59,294 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:46:59,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:46:57" (1/3) ... [2019-01-12 14:46:59,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c08300f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:46:59, skipping insertion in model container [2019-01-12 14:46:59,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:57" (2/3) ... [2019-01-12 14:46:59,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c08300f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:46:59, skipping insertion in model container [2019-01-12 14:46:59,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:59" (3/3) ... [2019-01-12 14:46:59,298 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product34_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:59,306 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:46:59,313 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:46:59,329 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:46:59,358 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:46:59,359 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:46:59,359 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:46:59,359 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:46:59,359 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:46:59,359 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:46:59,360 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:46:59,360 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:46:59,360 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:46:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2019-01-12 14:46:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 14:46:59,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:59,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:59,385 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:59,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:59,390 INFO L82 PathProgramCache]: Analyzing trace with hash -160768028, now seen corresponding path program 1 times [2019-01-12 14:46:59,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:59,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:59,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:59,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:59,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:59,671 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:59,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:59,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:59,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:46:59,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:46:59,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:46:59,695 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2019-01-12 14:46:59,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:59,725 INFO L93 Difference]: Finished difference Result 157 states and 240 transitions. [2019-01-12 14:46:59,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:46:59,727 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-01-12 14:46:59,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:59,740 INFO L225 Difference]: With dead ends: 157 [2019-01-12 14:46:59,740 INFO L226 Difference]: Without dead ends: 78 [2019-01-12 14:46:59,744 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:59,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-12 14:46:59,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-12 14:46:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-12 14:46:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2019-01-12 14:46:59,798 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 18 [2019-01-12 14:46:59,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:59,799 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2019-01-12 14:46:59,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:46:59,799 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2019-01-12 14:46:59,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 14:46:59,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:59,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:59,801 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:59,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:59,801 INFO L82 PathProgramCache]: Analyzing trace with hash -379603997, now seen corresponding path program 1 times [2019-01-12 14:46:59,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:59,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:59,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:59,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:59,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:00,000 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:47:00,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:00,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:47:00,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:47:00,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:47:00,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:00,007 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand 3 states. [2019-01-12 14:47:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:00,039 INFO L93 Difference]: Finished difference Result 78 states and 112 transitions. [2019-01-12 14:47:00,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:47:00,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-12 14:47:00,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:00,041 INFO L225 Difference]: With dead ends: 78 [2019-01-12 14:47:00,042 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 14:47:00,044 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:47:00,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 14:47:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-12 14:47:00,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 14:47:00,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2019-01-12 14:47:00,056 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 19 [2019-01-12 14:47:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:00,057 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-01-12 14:47:00,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:47:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2019-01-12 14:47:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:47:00,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:00,060 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:47:00,061 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:00,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:00,061 INFO L82 PathProgramCache]: Analyzing trace with hash -301457865, now seen corresponding path program 1 times [2019-01-12 14:47:00,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:00,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:00,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:00,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:00,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:00,230 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:47:00,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:00,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:47:00,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:47:00,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:47:00,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:47:00,233 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 5 states. [2019-01-12 14:47:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:00,349 INFO L93 Difference]: Finished difference Result 65 states and 95 transitions. [2019-01-12 14:47:00,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:47:00,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-01-12 14:47:00,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:00,351 INFO L225 Difference]: With dead ends: 65 [2019-01-12 14:47:00,352 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 14:47:00,353 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:47:00,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 14:47:00,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-12 14:47:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 14:47:00,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2019-01-12 14:47:00,359 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 24 [2019-01-12 14:47:00,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:00,360 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2019-01-12 14:47:00,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:47:00,360 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2019-01-12 14:47:00,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:47:00,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:00,362 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:47:00,363 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:00,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:00,363 INFO L82 PathProgramCache]: Analyzing trace with hash -608954119, now seen corresponding path program 1 times [2019-01-12 14:47:00,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:00,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:00,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:00,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:00,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:00,462 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:47:00,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:00,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:47:00,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:47:00,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:47:00,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:00,465 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 3 states. [2019-01-12 14:47:00,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:00,602 INFO L93 Difference]: Finished difference Result 87 states and 125 transitions. [2019-01-12 14:47:00,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:47:00,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-12 14:47:00,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:00,605 INFO L225 Difference]: With dead ends: 87 [2019-01-12 14:47:00,605 INFO L226 Difference]: Without dead ends: 58 [2019-01-12 14:47:00,606 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:47:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-12 14:47:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-01-12 14:47:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-12 14:47:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2019-01-12 14:47:00,617 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 25 [2019-01-12 14:47:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:00,618 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2019-01-12 14:47:00,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:47:00,618 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2019-01-12 14:47:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:47:00,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:00,619 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:47:00,621 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:00,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:00,621 INFO L82 PathProgramCache]: Analyzing trace with hash -584147931, now seen corresponding path program 1 times [2019-01-12 14:47:00,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:00,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:00,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:00,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:00,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:00,782 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:47:00,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:00,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:47:00,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:47:00,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:47:00,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:47:00,785 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand 5 states. [2019-01-12 14:47:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:01,081 INFO L93 Difference]: Finished difference Result 254 states and 372 transitions. [2019-01-12 14:47:01,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:47:01,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:47:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:01,087 INFO L225 Difference]: With dead ends: 254 [2019-01-12 14:47:01,087 INFO L226 Difference]: Without dead ends: 205 [2019-01-12 14:47:01,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:47:01,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-01-12 14:47:01,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 97. [2019-01-12 14:47:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-12 14:47:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2019-01-12 14:47:01,109 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 31 [2019-01-12 14:47:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:01,110 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2019-01-12 14:47:01,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:47:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2019-01-12 14:47:01,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:47:01,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:01,113 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:47:01,113 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:01,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:01,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1078415005, now seen corresponding path program 1 times [2019-01-12 14:47:01,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:01,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:01,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:01,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:01,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:01,240 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:47:01,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:01,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:47:01,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:47:01,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:47:01,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:47:01,242 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand 5 states. [2019-01-12 14:47:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:01,809 INFO L93 Difference]: Finished difference Result 346 states and 493 transitions. [2019-01-12 14:47:01,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:47:01,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-01-12 14:47:01,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:01,813 INFO L225 Difference]: With dead ends: 346 [2019-01-12 14:47:01,814 INFO L226 Difference]: Without dead ends: 256 [2019-01-12 14:47:01,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:47:01,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-01-12 14:47:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 96. [2019-01-12 14:47:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-12 14:47:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2019-01-12 14:47:01,861 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 32 [2019-01-12 14:47:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:01,861 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2019-01-12 14:47:01,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:47:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2019-01-12 14:47:01,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:47:01,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:01,866 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:47:01,867 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:01,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:01,867 INFO L82 PathProgramCache]: Analyzing trace with hash 144951296, now seen corresponding path program 1 times [2019-01-12 14:47:01,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:01,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:01,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:01,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:01,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:02,144 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:47:02,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:02,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:47:02,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:47:02,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:47:02,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:47:02,146 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand 5 states. [2019-01-12 14:47:02,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:02,313 INFO L93 Difference]: Finished difference Result 245 states and 340 transitions. [2019-01-12 14:47:02,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:47:02,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-01-12 14:47:02,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:02,317 INFO L225 Difference]: With dead ends: 245 [2019-01-12 14:47:02,317 INFO L226 Difference]: Without dead ends: 156 [2019-01-12 14:47:02,318 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:47:02,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-12 14:47:02,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 102. [2019-01-12 14:47:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-12 14:47:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 139 transitions. [2019-01-12 14:47:02,350 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 139 transitions. Word has length 32 [2019-01-12 14:47:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:02,350 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 139 transitions. [2019-01-12 14:47:02,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:47:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 139 transitions. [2019-01-12 14:47:02,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:47:02,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:02,354 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:47:02,354 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:02,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:02,355 INFO L82 PathProgramCache]: Analyzing trace with hash 846015874, now seen corresponding path program 1 times [2019-01-12 14:47:02,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:02,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:02,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:02,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:02,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:02,516 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:47:02,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:02,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:47:02,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:47:02,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:47:02,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:47:02,518 INFO L87 Difference]: Start difference. First operand 102 states and 139 transitions. Second operand 4 states. [2019-01-12 14:47:02,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:02,614 INFO L93 Difference]: Finished difference Result 243 states and 331 transitions. [2019-01-12 14:47:02,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:47:02,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-01-12 14:47:02,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:02,615 INFO L225 Difference]: With dead ends: 243 [2019-01-12 14:47:02,616 INFO L226 Difference]: Without dead ends: 148 [2019-01-12 14:47:02,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:47:02,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-12 14:47:02,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 106. [2019-01-12 14:47:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-12 14:47:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 143 transitions. [2019-01-12 14:47:02,637 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 143 transitions. Word has length 32 [2019-01-12 14:47:02,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:02,638 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 143 transitions. [2019-01-12 14:47:02,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:47:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 143 transitions. [2019-01-12 14:47:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:47:02,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:02,640 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:47:02,640 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:02,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:02,640 INFO L82 PathProgramCache]: Analyzing trace with hash 259209860, now seen corresponding path program 1 times [2019-01-12 14:47:02,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:02,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:02,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:02,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:02,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:02,727 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:47:02,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:02,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:47:02,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:47:02,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:47:02,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:02,729 INFO L87 Difference]: Start difference. First operand 106 states and 143 transitions. Second operand 3 states. [2019-01-12 14:47:02,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:02,877 INFO L93 Difference]: Finished difference Result 253 states and 341 transitions. [2019-01-12 14:47:02,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:47:02,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-01-12 14:47:02,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:02,879 INFO L225 Difference]: With dead ends: 253 [2019-01-12 14:47:02,879 INFO L226 Difference]: Without dead ends: 154 [2019-01-12 14:47:02,880 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:47:02,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-12 14:47:02,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-01-12 14:47:02,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-12 14:47:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 201 transitions. [2019-01-12 14:47:02,908 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 201 transitions. Word has length 32 [2019-01-12 14:47:02,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:02,909 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 201 transitions. [2019-01-12 14:47:02,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:47:02,909 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 201 transitions. [2019-01-12 14:47:02,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:47:02,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:02,910 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, 1] [2019-01-12 14:47:02,911 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:02,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:02,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1203693628, now seen corresponding path program 1 times [2019-01-12 14:47:02,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:02,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:02,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:02,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:02,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:03,013 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:47:03,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:03,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:47:03,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:47:03,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:47:03,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:03,018 INFO L87 Difference]: Start difference. First operand 154 states and 201 transitions. Second operand 3 states. [2019-01-12 14:47:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:03,164 INFO L93 Difference]: Finished difference Result 221 states and 291 transitions. [2019-01-12 14:47:03,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:47:03,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-01-12 14:47:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:03,166 INFO L225 Difference]: With dead ends: 221 [2019-01-12 14:47:03,167 INFO L226 Difference]: Without dead ends: 219 [2019-01-12 14:47:03,167 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:47:03,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-01-12 14:47:03,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 183. [2019-01-12 14:47:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-01-12 14:47:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 244 transitions. [2019-01-12 14:47:03,203 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 244 transitions. Word has length 33 [2019-01-12 14:47:03,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:03,204 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 244 transitions. [2019-01-12 14:47:03,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:47:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 244 transitions. [2019-01-12 14:47:03,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 14:47:03,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:03,206 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:47:03,206 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:03,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:03,207 INFO L82 PathProgramCache]: Analyzing trace with hash -389004008, now seen corresponding path program 1 times [2019-01-12 14:47:03,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:03,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:03,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:03,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:03,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:47:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:47:03,808 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:47:03,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:47:03 BoogieIcfgContainer [2019-01-12 14:47:03,965 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:47:03,966 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:47:03,966 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:47:03,966 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:47:03,966 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:59" (3/4) ... [2019-01-12 14:47:03,969 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:47:04,159 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:47:04,160 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:47:04,160 INFO L168 Benchmark]: Toolchain (without parser) took 7029.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:04,162 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:47:04,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 700.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:04,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.22 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:04,163 INFO L168 Benchmark]: Boogie Preprocessor took 40.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:47:04,163 INFO L168 Benchmark]: RCFGBuilder took 1329.99 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: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:04,163 INFO L168 Benchmark]: TraceAbstraction took 4674.01 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -61.1 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:04,163 INFO L168 Benchmark]: Witness Printer took 193.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:04,166 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 700.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.22 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1329.99 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: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4674.01 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -61.1 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. * Witness Printer took 193.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 249]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L151] int waterLevel = 1; [L152] int methaneLevelCritical = 0; [L255] int methAndRunningLastTime ; [L498] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L765] int pumpRunning = 0; [L766] int systemActive = 1; [L123] int retValue_acc ; [L124] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L320] int retValue_acc ; [L323] retValue_acc = 1 [L324] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L130] tmp = valid_product() [L132] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L260] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L697] int splverifierCounter ; [L698] int tmp ; [L699] int tmp___0 ; [L700] int tmp___1 ; [L701] int tmp___2 ; [L704] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L706] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L708] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L714] tmp = __VERIFIER_nondet_int() [L716] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L169] COND TRUE waterLevel < 2 [L170] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L724] tmp___0 = __VERIFIER_nondet_int() [L726] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L181] COND FALSE !(\read(methaneLevelCritical)) [L184] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L734] tmp___2 = __VERIFIER_nondet_int() [L736] COND TRUE \read(tmp___2) [L920] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L772] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L779] COND TRUE \read(systemActive) [L801] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L804] COND TRUE ! pumpRunning [L898] int retValue_acc ; [L899] int tmp ; [L900] int tmp___0 ; [L231] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L234] COND FALSE !(waterLevel < 2) [L238] retValue_acc = 0 [L239] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L904] tmp = isHighWaterSensorDry() [L906] COND FALSE !(\read(tmp)) [L909] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L911] retValue_acc = tmp___0 [L912] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L806] tmp = isHighWaterLevel() [L808] COND TRUE \read(tmp) [L829] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L265] int tmp ; [L266] int tmp___0 ; [L190] int retValue_acc ; [L193] retValue_acc = methaneLevelCritical [L194] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L270] tmp = isMethaneLevelCritical() [L272] COND TRUE \read(tmp) [L853] int retValue_acc ; [L856] retValue_acc = pumpRunning [L857] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L274] tmp___0 = isPumpRunning() [L276] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L277] COND FALSE !(\read(methAndRunningLastTime)) [L282] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L706] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L708] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L714] tmp = __VERIFIER_nondet_int() [L716] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L724] tmp___0 = __VERIFIER_nondet_int() [L726] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L734] tmp___2 = __VERIFIER_nondet_int() [L736] COND TRUE \read(tmp___2) [L920] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L772] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L157] COND TRUE waterLevel > 0 [L158] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L779] COND TRUE \read(systemActive) [L801] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L804] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L265] int tmp ; [L266] int tmp___0 ; [L190] int retValue_acc ; [L193] retValue_acc = methaneLevelCritical [L194] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L270] tmp = isMethaneLevelCritical() [L272] COND TRUE \read(tmp) [L853] int retValue_acc ; [L856] retValue_acc = pumpRunning [L857] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L274] tmp___0 = isPumpRunning() [L276] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L277] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L249] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 3 error locations. UNSAFE Result, 4.6s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 648 SDtfs, 724 SDslu, 834 SDs, 0 SdLazy, 106 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 402 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 329 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 15114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...