./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product35_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec4_product35_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 cad5f4eca7a20f7ca6dddfa07fda554bac28f7be ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 09:43:37,970 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:43:37,972 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:43:37,984 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:43:37,984 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:43:37,986 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:43:37,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:43:37,994 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:43:37,997 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:43:37,998 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:43:37,999 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:43:38,000 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:43:38,001 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:43:38,001 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:43:38,003 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:43:38,003 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:43:38,004 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:43:38,006 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:43:38,008 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:43:38,010 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:43:38,011 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:43:38,012 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:43:38,015 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:43:38,015 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:43:38,015 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:43:38,016 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:43:38,017 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:43:38,018 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:43:38,019 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:43:38,020 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:43:38,020 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:43:38,021 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:43:38,021 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:43:38,021 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:43:38,022 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:43:38,023 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:43:38,023 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:43:38,039 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:43:38,039 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:43:38,041 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:43:38,041 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:43:38,041 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:43:38,041 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:43:38,041 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:43:38,042 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:43:38,042 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:43:38,042 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:43:38,042 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:43:38,042 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:43:38,043 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:43:38,043 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:43:38,043 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:43:38,043 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:43:38,043 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:43:38,043 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:43:38,044 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:43:38,044 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:43:38,044 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:43:38,044 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:43:38,044 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:43:38,045 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:43:38,045 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:43:38,045 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:43:38,045 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:43:38,045 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:43:38,045 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 -> cad5f4eca7a20f7ca6dddfa07fda554bac28f7be [2018-12-31 09:43:38,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:43:38,107 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:43:38,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:43:38,117 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:43:38,118 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:43:38,119 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product35_false-unreach-call_false-termination.cil.c [2018-12-31 09:43:38,188 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94cd82976/726b56a01966467ea8e0b486ee4f6f64/FLAG4c66b7be2 [2018-12-31 09:43:38,742 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:43:38,743 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product35_false-unreach-call_false-termination.cil.c [2018-12-31 09:43:38,768 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94cd82976/726b56a01966467ea8e0b486ee4f6f64/FLAG4c66b7be2 [2018-12-31 09:43:39,017 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94cd82976/726b56a01966467ea8e0b486ee4f6f64 [2018-12-31 09:43:39,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:43:39,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:43:39,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:43:39,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:43:39,030 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:43:39,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:43:39" (1/1) ... [2018-12-31 09:43:39,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68686ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:39, skipping insertion in model container [2018-12-31 09:43:39,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:43:39" (1/1) ... [2018-12-31 09:43:39,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:43:39,097 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:43:39,547 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:43:39,578 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:43:39,697 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:43:39,816 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:43:39,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:39 WrapperNode [2018-12-31 09:43:39,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:43:39,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:43:39,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:43:39,818 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:43:39,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:39" (1/1) ... [2018-12-31 09:43:39,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:39" (1/1) ... [2018-12-31 09:43:39,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:43:39,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:43:39,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:43:39,892 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:43:39,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:39" (1/1) ... [2018-12-31 09:43:39,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:39" (1/1) ... [2018-12-31 09:43:39,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:39" (1/1) ... [2018-12-31 09:43:39,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:39" (1/1) ... [2018-12-31 09:43:39,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:39" (1/1) ... [2018-12-31 09:43:39,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:39" (1/1) ... [2018-12-31 09:43:39,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:39" (1/1) ... [2018-12-31 09:43:39,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:43:39,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:43:39,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:43:39,961 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:43:39,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:43:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:43:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:43:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:43:40,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:43:41,225 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:43:41,226 INFO L280 CfgBuilder]: Removed 100 assue(true) statements. [2018-12-31 09:43:41,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:43:41 BoogieIcfgContainer [2018-12-31 09:43:41,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:43:41,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:43:41,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:43:41,231 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:43:41,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:43:39" (1/3) ... [2018-12-31 09:43:41,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d330e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:43:41, skipping insertion in model container [2018-12-31 09:43:41,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:39" (2/3) ... [2018-12-31 09:43:41,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d330e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:43:41, skipping insertion in model container [2018-12-31 09:43:41,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:43:41" (3/3) ... [2018-12-31 09:43:41,234 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product35_false-unreach-call_false-termination.cil.c [2018-12-31 09:43:41,245 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:43:41,253 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:43:41,272 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:43:41,306 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:43:41,307 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:43:41,307 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:43:41,307 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:43:41,308 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:43:41,308 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:43:41,308 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:43:41,308 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:43:41,308 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:43:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-12-31 09:43:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:43:41,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:41,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:41,342 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:41,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:41,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1355288485, now seen corresponding path program 1 times [2018-12-31 09:43:41,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:41,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:41,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:41,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:41,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:41,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:41,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:43:41,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:43:41,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:43:41,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:43:41,630 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2018-12-31 09:43:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:41,661 INFO L93 Difference]: Finished difference Result 154 states and 233 transitions. [2018-12-31 09:43:41,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:43:41,663 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:43:41,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:41,676 INFO L225 Difference]: With dead ends: 154 [2018-12-31 09:43:41,676 INFO L226 Difference]: Without dead ends: 76 [2018-12-31 09:43:41,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:43:41,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-31 09:43:41,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-31 09:43:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-31 09:43:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2018-12-31 09:43:41,728 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 16 [2018-12-31 09:43:41,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:41,729 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2018-12-31 09:43:41,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:43:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2018-12-31 09:43:41,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:43:41,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:41,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:41,731 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:41,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:41,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1892921914, now seen corresponding path program 1 times [2018-12-31 09:43:41,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:41,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:41,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:41,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:41,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:41,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:41,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:43:41,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:43:41,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:43:41,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:41,965 INFO L87 Difference]: Start difference. First operand 76 states and 108 transitions. Second operand 3 states. [2018-12-31 09:43:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:41,999 INFO L93 Difference]: Finished difference Result 76 states and 108 transitions. [2018-12-31 09:43:41,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:43:42,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:43:42,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:42,001 INFO L225 Difference]: With dead ends: 76 [2018-12-31 09:43:42,001 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 09:43:42,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 09:43:42,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-31 09:43:42,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 09:43:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-12-31 09:43:42,019 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 17 [2018-12-31 09:43:42,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:42,019 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-12-31 09:43:42,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:43:42,020 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-12-31 09:43:42,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:43:42,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:42,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:42,023 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:42,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:42,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1160602350, now seen corresponding path program 1 times [2018-12-31 09:43:42,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:42,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:42,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:42,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:42,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:42,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:42,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:42,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:43:42,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:43:42,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:43:42,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:42,193 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2018-12-31 09:43:42,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:42,269 INFO L93 Difference]: Finished difference Result 96 states and 141 transitions. [2018-12-31 09:43:42,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:43:42,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-31 09:43:42,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:42,275 INFO L225 Difference]: With dead ends: 96 [2018-12-31 09:43:42,276 INFO L226 Difference]: Without dead ends: 66 [2018-12-31 09:43:42,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:42,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-31 09:43:42,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-12-31 09:43:42,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-31 09:43:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2018-12-31 09:43:42,294 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 22 [2018-12-31 09:43:42,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:42,294 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2018-12-31 09:43:42,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:43:42,295 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2018-12-31 09:43:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 09:43:42,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:42,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:42,297 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:42,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:42,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1572373846, now seen corresponding path program 1 times [2018-12-31 09:43:42,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:42,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:42,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:42,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:42,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:42,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:42,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:43:42,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:43:42,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:43:42,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:42,426 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand 3 states. [2018-12-31 09:43:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:42,587 INFO L93 Difference]: Finished difference Result 159 states and 238 transitions. [2018-12-31 09:43:42,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:43:42,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-31 09:43:42,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:42,590 INFO L225 Difference]: With dead ends: 159 [2018-12-31 09:43:42,590 INFO L226 Difference]: Without dead ends: 103 [2018-12-31 09:43:42,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:42,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-31 09:43:42,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-12-31 09:43:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-31 09:43:42,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2018-12-31 09:43:42,610 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 23 [2018-12-31 09:43:42,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:42,610 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2018-12-31 09:43:42,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:43:42,610 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2018-12-31 09:43:42,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:43:42,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:42,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:42,612 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:42,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:42,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1956458727, now seen corresponding path program 1 times [2018-12-31 09:43:42,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:42,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:42,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:42,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:42,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:42,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:42,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:43:42,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:43:42,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:43:42,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:43:42,756 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand 5 states. [2018-12-31 09:43:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:43,175 INFO L93 Difference]: Finished difference Result 369 states and 545 transitions. [2018-12-31 09:43:43,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:43:43,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-31 09:43:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:43,183 INFO L225 Difference]: With dead ends: 369 [2018-12-31 09:43:43,183 INFO L226 Difference]: Without dead ends: 274 [2018-12-31 09:43:43,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:43:43,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-31 09:43:43,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 182. [2018-12-31 09:43:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-31 09:43:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 256 transitions. [2018-12-31 09:43:43,212 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 256 transitions. Word has length 25 [2018-12-31 09:43:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:43,212 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 256 transitions. [2018-12-31 09:43:43,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:43:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 256 transitions. [2018-12-31 09:43:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 09:43:43,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:43,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:43,214 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:43,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:43,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2850263, now seen corresponding path program 1 times [2018-12-31 09:43:43,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:43,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:43,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:43,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:43,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:43,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:43,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:43,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:43:43,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:43:43,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:43:43,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:43:43,572 INFO L87 Difference]: Start difference. First operand 182 states and 256 transitions. Second operand 5 states. [2018-12-31 09:43:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:44,281 INFO L93 Difference]: Finished difference Result 368 states and 530 transitions. [2018-12-31 09:43:44,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:43:44,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-31 09:43:44,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:44,285 INFO L225 Difference]: With dead ends: 368 [2018-12-31 09:43:44,285 INFO L226 Difference]: Without dead ends: 366 [2018-12-31 09:43:44,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:43:44,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-12-31 09:43:44,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 182. [2018-12-31 09:43:44,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-31 09:43:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 254 transitions. [2018-12-31 09:43:44,336 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 254 transitions. Word has length 26 [2018-12-31 09:43:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:44,336 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 254 transitions. [2018-12-31 09:43:44,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:43:44,337 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 254 transitions. [2018-12-31 09:43:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:43:44,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:44,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:44,341 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:44,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:44,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2047428375, now seen corresponding path program 1 times [2018-12-31 09:43:44,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:44,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:44,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:44,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:44,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:44,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:44,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:43:44,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:43:44,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:43:44,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:43:44,620 INFO L87 Difference]: Start difference. First operand 182 states and 254 transitions. Second operand 5 states. [2018-12-31 09:43:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:45,038 INFO L93 Difference]: Finished difference Result 505 states and 702 transitions. [2018-12-31 09:43:45,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:43:45,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-31 09:43:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:45,041 INFO L225 Difference]: With dead ends: 505 [2018-12-31 09:43:45,041 INFO L226 Difference]: Without dead ends: 329 [2018-12-31 09:43:45,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:43:45,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-12-31 09:43:45,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 194. [2018-12-31 09:43:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-31 09:43:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 266 transitions. [2018-12-31 09:43:45,071 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 266 transitions. Word has length 30 [2018-12-31 09:43:45,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:45,071 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 266 transitions. [2018-12-31 09:43:45,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:43:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 266 transitions. [2018-12-31 09:43:45,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:43:45,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:45,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:45,075 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:45,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:45,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1854511911, now seen corresponding path program 1 times [2018-12-31 09:43:45,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:45,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:45,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:45,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:45,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:45,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:45,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:45,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:43:45,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:43:45,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:43:45,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:43:45,150 INFO L87 Difference]: Start difference. First operand 194 states and 266 transitions. Second operand 4 states. [2018-12-31 09:43:45,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:45,401 INFO L93 Difference]: Finished difference Result 426 states and 583 transitions. [2018-12-31 09:43:45,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:43:45,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-12-31 09:43:45,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:45,403 INFO L225 Difference]: With dead ends: 426 [2018-12-31 09:43:45,404 INFO L226 Difference]: Without dead ends: 238 [2018-12-31 09:43:45,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:43:45,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-12-31 09:43:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 159. [2018-12-31 09:43:45,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-31 09:43:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 214 transitions. [2018-12-31 09:43:45,430 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 214 transitions. Word has length 30 [2018-12-31 09:43:45,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:45,430 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 214 transitions. [2018-12-31 09:43:45,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:43:45,431 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 214 transitions. [2018-12-31 09:43:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:43:45,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:45,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:45,432 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:45,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:45,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2112677349, now seen corresponding path program 1 times [2018-12-31 09:43:45,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:45,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:45,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:45,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:45,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:45,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:45,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:43:45,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:43:45,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:43:45,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:43:45,682 INFO L87 Difference]: Start difference. First operand 159 states and 214 transitions. Second operand 5 states. [2018-12-31 09:43:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:46,296 INFO L93 Difference]: Finished difference Result 420 states and 588 transitions. [2018-12-31 09:43:46,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:43:46,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-31 09:43:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:46,299 INFO L225 Difference]: With dead ends: 420 [2018-12-31 09:43:46,299 INFO L226 Difference]: Without dead ends: 315 [2018-12-31 09:43:46,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:43:46,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-31 09:43:46,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 236. [2018-12-31 09:43:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-12-31 09:43:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 315 transitions. [2018-12-31 09:43:46,329 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 315 transitions. Word has length 30 [2018-12-31 09:43:46,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:46,329 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 315 transitions. [2018-12-31 09:43:46,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:43:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 315 transitions. [2018-12-31 09:43:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 09:43:46,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:46,331 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:46,331 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1942803224, now seen corresponding path program 1 times [2018-12-31 09:43:46,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:46,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:46,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:46,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:46,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:46,524 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:46,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:43:46,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:43:46,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:46,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:43:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:46,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:43:46,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-31 09:43:46,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:43:46,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:43:46,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:43:46,735 INFO L87 Difference]: Start difference. First operand 236 states and 315 transitions. Second operand 6 states. [2018-12-31 09:43:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:48,194 INFO L93 Difference]: Finished difference Result 699 states and 959 transitions. [2018-12-31 09:43:48,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:43:48,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-12-31 09:43:48,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:48,200 INFO L225 Difference]: With dead ends: 699 [2018-12-31 09:43:48,200 INFO L226 Difference]: Without dead ends: 517 [2018-12-31 09:43:48,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:43:48,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-12-31 09:43:48,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 321. [2018-12-31 09:43:48,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-12-31 09:43:48,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 433 transitions. [2018-12-31 09:43:48,263 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 433 transitions. Word has length 45 [2018-12-31 09:43:48,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:48,265 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 433 transitions. [2018-12-31 09:43:48,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:43:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 433 transitions. [2018-12-31 09:43:48,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-31 09:43:48,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:48,267 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-31 09:43:48,267 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:48,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:48,267 INFO L82 PathProgramCache]: Analyzing trace with hash 511998341, now seen corresponding path program 2 times [2018-12-31 09:43:48,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:48,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:48,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:48,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:48,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:43:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:43:48,976 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:43:49,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:43:49 BoogieIcfgContainer [2018-12-31 09:43:49,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:43:49,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:43:49,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:43:49,159 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:43:49,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:43:41" (3/4) ... [2018-12-31 09:43:49,163 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:43:49,322 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:43:49,322 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:43:49,323 INFO L168 Benchmark]: Toolchain (without parser) took 10300.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 943.3 MB in the beginning and 985.7 MB in the end (delta: -42.4 MB). Peak memory consumption was 165.2 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:49,326 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:43:49,326 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:49,327 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.75 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. [2018-12-31 09:43:49,327 INFO L168 Benchmark]: Boogie Preprocessor took 68.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:43:49,327 INFO L168 Benchmark]: RCFGBuilder took 1265.68 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: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:49,329 INFO L168 Benchmark]: TraceAbstraction took 7931.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.0 MB). Peak memory consumption was 119.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:49,330 INFO L168 Benchmark]: Witness Printer took 163.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 985.7 MB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:49,334 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.20 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 792.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.75 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 68.19 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 1265.68 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: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7931.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.0 MB). Peak memory consumption was 119.4 MB. Max. memory is 11.5 GB. * Witness Printer took 163.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 985.7 MB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 784]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L148] int pumpRunning = 0; [L149] int systemActive = 1; [L315] int cleanupTimeShifts = 4; [L583] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L824] int waterLevel = 1; [L825] int methaneLevelCritical = 0; [L391] int retValue_acc ; [L392] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L815] int retValue_acc ; [L818] retValue_acc = 1 [L819] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L398] tmp = valid_product() [L400] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L46] int splverifierCounter ; [L47] int tmp ; [L48] int tmp___0 ; [L49] int tmp___1 ; [L50] int tmp___2 ; [L53] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L55] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L57] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L63] tmp = __VERIFIER_nondet_int() [L65] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L842] COND TRUE waterLevel < 2 [L843] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L155] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L162] COND TRUE \read(systemActive) [L184] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L187] COND TRUE ! pumpRunning [L281] int retValue_acc ; [L282] int tmp ; [L283] int tmp___0 ; [L904] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L907] COND FALSE !(waterLevel < 2) [L911] retValue_acc = 0 [L912] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L287] tmp = isHighWaterSensorDry() [L289] COND FALSE !(\read(tmp)) [L292] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L294] retValue_acc = tmp___0 [L295] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L189] tmp = isHighWaterLevel() [L191] COND TRUE \read(tmp) [L212] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L116] int tmp ; [L117] int tmp___0 ; [L895] int retValue_acc ; [L898] retValue_acc = waterLevel [L899] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L121] tmp = getWaterLevel() [L123] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L55] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L57] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L63] tmp = __VERIFIER_nondet_int() [L65] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L155] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L830] COND TRUE waterLevel > 0 [L831] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L162] COND TRUE \read(systemActive) [L184] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L187] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L116] int tmp ; [L117] int tmp___0 ; [L895] int retValue_acc ; [L898] retValue_acc = waterLevel [L899] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L121] tmp = getWaterLevel() [L123] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L55] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L57] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L63] tmp = __VERIFIER_nondet_int() [L65] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L155] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L830] COND TRUE waterLevel > 0 [L831] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L162] COND TRUE \read(systemActive) [L184] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L187] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L116] int tmp ; [L117] int tmp___0 ; [L895] int retValue_acc ; [L898] retValue_acc = waterLevel [L899] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L121] tmp = getWaterLevel() [L123] COND TRUE tmp == 0 [L236] int retValue_acc ; [L239] retValue_acc = pumpRunning [L240] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L125] tmp___0 = isPumpRunning() [L127] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L784] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 80 locations, 3 error locations. UNSAFE Result, 7.8s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 796 SDtfs, 909 SDslu, 1189 SDs, 0 SdLazy, 191 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=321occurred 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, 771 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 17410 SizeOfPredicates, 4 NumberOfNonLiveVariables, 374 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 22/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...