./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product55_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_spec1_product55_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 f98010979adc33ea49508c52e1057d4173359b78 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:41:49,235 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:41:49,236 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:41:49,248 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:41:49,248 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:41:49,249 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:41:49,251 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:41:49,253 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:41:49,254 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:41:49,255 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:41:49,256 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:41:49,256 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:41:49,257 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:41:49,258 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:41:49,259 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:41:49,260 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:41:49,261 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:41:49,263 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:41:49,265 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:41:49,266 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:41:49,268 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:41:49,269 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:41:49,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:41:49,272 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:41:49,272 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:41:49,273 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:41:49,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:41:49,275 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:41:49,275 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:41:49,277 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:41:49,277 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:41:49,277 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:41:49,278 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:41:49,278 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:41:49,279 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:41:49,280 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:41:49,280 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:41:49,314 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:41:49,314 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:41:49,315 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:41:49,315 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:41:49,316 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:41:49,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:41:49,316 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:41:49,316 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:41:49,317 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:41:49,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:41:49,317 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:41:49,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:41:49,317 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:41:49,317 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:41:49,318 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:41:49,318 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:41:49,318 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:41:49,318 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:41:49,318 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:41:49,319 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:41:49,319 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:41:49,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:41:49,319 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:41:49,319 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:41:49,320 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:41:49,320 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:41:49,320 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:41:49,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:41:49,320 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 -> f98010979adc33ea49508c52e1057d4173359b78 [2018-12-31 09:41:49,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:41:49,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:41:49,382 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:41:49,384 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:41:49,385 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:41:49,385 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product55_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:49,444 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1debc4f6/a21599dc574b44bdb25ff6ff7a8ebb5b/FLAGe7b1fba6d [2018-12-31 09:41:49,926 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:41:49,928 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product55_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:49,943 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1debc4f6/a21599dc574b44bdb25ff6ff7a8ebb5b/FLAGe7b1fba6d [2018-12-31 09:41:50,230 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1debc4f6/a21599dc574b44bdb25ff6ff7a8ebb5b [2018-12-31 09:41:50,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:41:50,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:41:50,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:41:50,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:41:50,243 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:41:50,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:41:50" (1/1) ... [2018-12-31 09:41:50,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79174781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50, skipping insertion in model container [2018-12-31 09:41:50,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:41:50" (1/1) ... [2018-12-31 09:41:50,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:41:50,309 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:41:50,763 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:41:50,779 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:41:50,873 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:41:50,910 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:41:50,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50 WrapperNode [2018-12-31 09:41:50,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:41:50,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:41:50,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:41:50,911 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:41:50,990 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:41:50" (1/1) ... [2018-12-31 09:41:51,023 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:41:50" (1/1) ... [2018-12-31 09:41:51,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:41:51,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:41:51,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:41:51,130 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:41:51,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (1/1) ... [2018-12-31 09:41:51,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (1/1) ... [2018-12-31 09:41:51,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (1/1) ... [2018-12-31 09:41:51,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (1/1) ... [2018-12-31 09:41:51,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (1/1) ... [2018-12-31 09:41:51,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (1/1) ... [2018-12-31 09:41:51,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (1/1) ... [2018-12-31 09:41:51,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:41:51,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:41:51,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:41:51,251 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:41:51,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (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:41:51,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:41:51,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:41:51,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:41:51,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:41:53,617 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:41:53,618 INFO L280 CfgBuilder]: Removed 280 assue(true) statements. [2018-12-31 09:41:53,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:53 BoogieIcfgContainer [2018-12-31 09:41:53,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:41:53,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:41:53,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:41:53,623 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:41:53,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:41:50" (1/3) ... [2018-12-31 09:41:53,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35af484b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:41:53, skipping insertion in model container [2018-12-31 09:41:53,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (2/3) ... [2018-12-31 09:41:53,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35af484b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:41:53, skipping insertion in model container [2018-12-31 09:41:53,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:53" (3/3) ... [2018-12-31 09:41:53,627 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product55_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:53,637 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:41:53,647 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:41:53,666 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:41:53,703 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:41:53,704 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:41:53,704 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:41:53,704 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:41:53,704 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:41:53,705 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:41:53,705 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:41:53,705 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:41:53,705 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:41:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states. [2018-12-31 09:41:53,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:41:53,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:53,738 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:41:53,740 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:53,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:53,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1084846627, now seen corresponding path program 1 times [2018-12-31 09:41:53,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:53,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:53,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:53,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:53,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:54,027 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:41:54,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:54,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:54,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:41:54,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:41:54,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:41:54,048 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 2 states. [2018-12-31 09:41:54,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:54,096 INFO L93 Difference]: Finished difference Result 376 states and 575 transitions. [2018-12-31 09:41:54,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:41:54,097 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:41:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:54,111 INFO L225 Difference]: With dead ends: 376 [2018-12-31 09:41:54,112 INFO L226 Difference]: Without dead ends: 187 [2018-12-31 09:41:54,115 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:41:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-31 09:41:54,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-12-31 09:41:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-31 09:41:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 279 transitions. [2018-12-31 09:41:54,176 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 279 transitions. Word has length 16 [2018-12-31 09:41:54,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:54,177 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 279 transitions. [2018-12-31 09:41:54,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:41:54,177 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 279 transitions. [2018-12-31 09:41:54,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:41:54,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:54,179 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:41:54,179 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:54,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:54,179 INFO L82 PathProgramCache]: Analyzing trace with hash 38089730, now seen corresponding path program 1 times [2018-12-31 09:41:54,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:54,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:54,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:54,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:54,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:54,337 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:41:54,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:54,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:41:54,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:54,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:54,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:54,344 INFO L87 Difference]: Start difference. First operand 187 states and 279 transitions. Second operand 3 states. [2018-12-31 09:41:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:54,377 INFO L93 Difference]: Finished difference Result 187 states and 279 transitions. [2018-12-31 09:41:54,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:54,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:41:54,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:54,382 INFO L225 Difference]: With dead ends: 187 [2018-12-31 09:41:54,382 INFO L226 Difference]: Without dead ends: 73 [2018-12-31 09:41:54,383 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:41:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-31 09:41:54,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-31 09:41:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-31 09:41:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2018-12-31 09:41:54,400 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 17 [2018-12-31 09:41:54,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:54,405 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2018-12-31 09:41:54,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:54,405 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2018-12-31 09:41:54,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:41:54,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:54,406 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:41:54,408 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:54,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:54,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1082167242, now seen corresponding path program 1 times [2018-12-31 09:41:54,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:54,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:54,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:54,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:54,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:54,672 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:41:54,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:54,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:41:54,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:41:54,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:41:54,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:41:54,674 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 6 states. [2018-12-31 09:41:54,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:54,844 INFO L93 Difference]: Finished difference Result 230 states and 346 transitions. [2018-12-31 09:41:54,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:41:54,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-31 09:41:54,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:54,847 INFO L225 Difference]: With dead ends: 230 [2018-12-31 09:41:54,847 INFO L226 Difference]: Without dead ends: 163 [2018-12-31 09:41:54,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:41:54,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-31 09:41:54,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 92. [2018-12-31 09:41:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-31 09:41:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 137 transitions. [2018-12-31 09:41:54,863 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 137 transitions. Word has length 22 [2018-12-31 09:41:54,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:54,864 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 137 transitions. [2018-12-31 09:41:54,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:41:54,864 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2018-12-31 09:41:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:41:54,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:54,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] [2018-12-31 09:41:54,866 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:54,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:54,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1933185311, now seen corresponding path program 1 times [2018-12-31 09:41:54,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:54,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:54,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:54,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:54,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:54,959 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:41:54,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:54,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:54,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:54,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:54,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:54,961 INFO L87 Difference]: Start difference. First operand 92 states and 137 transitions. Second operand 3 states. [2018-12-31 09:41:55,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:55,170 INFO L93 Difference]: Finished difference Result 187 states and 280 transitions. [2018-12-31 09:41:55,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:55,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-31 09:41:55,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:55,173 INFO L225 Difference]: With dead ends: 187 [2018-12-31 09:41:55,173 INFO L226 Difference]: Without dead ends: 101 [2018-12-31 09:41:55,174 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:41:55,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-31 09:41:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-12-31 09:41:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-31 09:41:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2018-12-31 09:41:55,205 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 25 [2018-12-31 09:41:55,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:55,206 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2018-12-31 09:41:55,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2018-12-31 09:41:55,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:41:55,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:55,211 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:41:55,212 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:55,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:55,212 INFO L82 PathProgramCache]: Analyzing trace with hash 2034893835, now seen corresponding path program 1 times [2018-12-31 09:41:55,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:55,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:55,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:55,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:55,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:55,585 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:41:55,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:55,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:55,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:55,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:55,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:55,587 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand 5 states. [2018-12-31 09:41:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:56,411 INFO L93 Difference]: Finished difference Result 281 states and 403 transitions. [2018-12-31 09:41:56,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:41:56,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-31 09:41:56,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:56,414 INFO L225 Difference]: With dead ends: 281 [2018-12-31 09:41:56,414 INFO L226 Difference]: Without dead ends: 279 [2018-12-31 09:41:56,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:41:56,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-31 09:41:56,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 99. [2018-12-31 09:41:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-31 09:41:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2018-12-31 09:41:56,437 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 25 [2018-12-31 09:41:56,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:56,437 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2018-12-31 09:41:56,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2018-12-31 09:41:56,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:56,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:56,444 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] [2018-12-31 09:41:56,445 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:56,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:56,445 INFO L82 PathProgramCache]: Analyzing trace with hash -899676752, now seen corresponding path program 1 times [2018-12-31 09:41:56,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:56,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:56,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:56,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:56,704 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:41:56,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:56,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:41:56,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:56,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:56,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:56,705 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand 5 states. [2018-12-31 09:41:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:57,487 INFO L93 Difference]: Finished difference Result 282 states and 395 transitions. [2018-12-31 09:41:57,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:41:57,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:41:57,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:57,490 INFO L225 Difference]: With dead ends: 282 [2018-12-31 09:41:57,490 INFO L226 Difference]: Without dead ends: 189 [2018-12-31 09:41:57,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:41:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-31 09:41:57,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 108. [2018-12-31 09:41:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-31 09:41:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 148 transitions. [2018-12-31 09:41:57,509 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 148 transitions. Word has length 31 [2018-12-31 09:41:57,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:57,510 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 148 transitions. [2018-12-31 09:41:57,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2018-12-31 09:41:57,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:57,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:57,511 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] [2018-12-31 09:41:57,512 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:57,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:57,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1292703762, now seen corresponding path program 1 times [2018-12-31 09:41:57,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:57,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:57,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:57,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:57,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:57,682 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:41:57,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:57,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:57,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:41:57,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:41:57,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:41:57,683 INFO L87 Difference]: Start difference. First operand 108 states and 148 transitions. Second operand 4 states. [2018-12-31 09:41:58,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:58,045 INFO L93 Difference]: Finished difference Result 266 states and 364 transitions. [2018-12-31 09:41:58,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:41:58,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-12-31 09:41:58,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:58,050 INFO L225 Difference]: With dead ends: 266 [2018-12-31 09:41:58,051 INFO L226 Difference]: Without dead ends: 164 [2018-12-31 09:41:58,051 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:41:58,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-31 09:41:58,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 114. [2018-12-31 09:41:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-31 09:41:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 154 transitions. [2018-12-31 09:41:58,071 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 154 transitions. Word has length 31 [2018-12-31 09:41:58,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:58,071 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 154 transitions. [2018-12-31 09:41:58,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:41:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 154 transitions. [2018-12-31 09:41:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:58,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:58,074 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] [2018-12-31 09:41:58,075 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:58,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:58,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1034538324, now seen corresponding path program 1 times [2018-12-31 09:41:58,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:58,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:58,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:58,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:58,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:58,162 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:41:58,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:58,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:58,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:58,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:58,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:58,164 INFO L87 Difference]: Start difference. First operand 114 states and 154 transitions. Second operand 3 states. [2018-12-31 09:41:58,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:58,367 INFO L93 Difference]: Finished difference Result 269 states and 365 transitions. [2018-12-31 09:41:58,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:58,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-31 09:41:58,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:58,370 INFO L225 Difference]: With dead ends: 269 [2018-12-31 09:41:58,370 INFO L226 Difference]: Without dead ends: 161 [2018-12-31 09:41:58,370 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:41:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-31 09:41:58,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-12-31 09:41:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-31 09:41:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 214 transitions. [2018-12-31 09:41:58,397 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 214 transitions. Word has length 31 [2018-12-31 09:41:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:58,397 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 214 transitions. [2018-12-31 09:41:58,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:58,397 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 214 transitions. [2018-12-31 09:41:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:41:58,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:58,399 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] [2018-12-31 09:41:58,399 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:58,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:58,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1147669102, now seen corresponding path program 1 times [2018-12-31 09:41:58,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:58,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:58,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:58,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:58,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:58,989 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-12-31 09:41:58,994 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:41:58,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:58,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:58,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:58,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:58,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:58,996 INFO L87 Difference]: Start difference. First operand 161 states and 214 transitions. Second operand 5 states. [2018-12-31 09:41:59,355 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-31 09:41:59,637 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-31 09:41:59,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:59,916 INFO L93 Difference]: Finished difference Result 818 states and 1098 transitions. [2018-12-31 09:41:59,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:41:59,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-31 09:41:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:59,922 INFO L225 Difference]: With dead ends: 818 [2018-12-31 09:41:59,922 INFO L226 Difference]: Without dead ends: 663 [2018-12-31 09:41:59,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:41:59,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-12-31 09:41:59,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 304. [2018-12-31 09:41:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-12-31 09:41:59,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 400 transitions. [2018-12-31 09:41:59,982 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 400 transitions. Word has length 32 [2018-12-31 09:41:59,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:59,983 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 400 transitions. [2018-12-31 09:41:59,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:59,983 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 400 transitions. [2018-12-31 09:41:59,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 09:41:59,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:59,984 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] [2018-12-31 09:41:59,986 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:59,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:59,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1539369524, now seen corresponding path program 1 times [2018-12-31 09:41:59,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:59,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:59,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:59,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:59,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:42:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:42:00,542 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:42:00,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:42:00 BoogieIcfgContainer [2018-12-31 09:42:00,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:42:00,670 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:42:00,670 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:42:00,670 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:42:00,671 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:53" (3/4) ... [2018-12-31 09:42:00,676 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:42:00,779 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:42:00,779 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:42:00,780 INFO L168 Benchmark]: Toolchain (without parser) took 10545.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 943.3 MB in the beginning and 1.0 GB in the end (delta: -102.4 MB). Peak memory consumption was 88.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:00,782 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:42:00,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.16 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 915.1 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:00,783 INFO L168 Benchmark]: Boogie Procedure Inliner took 218.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:00,783 INFO L168 Benchmark]: Boogie Preprocessor took 121.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:00,785 INFO L168 Benchmark]: RCFGBuilder took 2367.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.4 MB). Peak memory consumption was 72.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:00,786 INFO L168 Benchmark]: TraceAbstraction took 7049.94 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -40.4 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:00,786 INFO L168 Benchmark]: Witness Printer took 109.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:00,791 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 671.16 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 915.1 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 218.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 121.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2367.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.4 MB). Peak memory consumption was 72.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7049.94 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -40.4 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * Witness Printer took 109.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 506]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L159] int pumpRunning = 0; [L160] int systemActive = 1; [L399] int waterLevel = 1; [L400] int methaneLevelCritical = 0; [L511] int cleanupTimeShifts = 4; [L802] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L584] int retValue_acc ; [L585] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L591] tmp = valid_product() [L593] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L84] int splverifierCounter ; [L85] int tmp ; [L86] int tmp___0 ; [L87] int tmp___1 ; [L88] int tmp___2 ; [L91] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L93] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L95] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L101] tmp = __VERIFIER_nondet_int() [L103] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L417] COND TRUE waterLevel < 2 [L418] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L111] tmp___0 = __VERIFIER_nondet_int() [L113] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L429] COND FALSE !(\read(methaneLevelCritical)) [L432] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L121] tmp___2 = __VERIFIER_nondet_int() [L123] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L167] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L174] COND TRUE \read(systemActive) [L248] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L251] COND FALSE !(\read(pumpRunning)) [L222] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L225] COND FALSE !(\read(pumpRunning)) [L196] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L199] COND TRUE ! pumpRunning [L345] int retValue_acc ; [L346] int tmp ; [L347] int tmp___0 ; [L479] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L482] COND FALSE !(waterLevel < 2) [L486] retValue_acc = 0 [L487] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L351] tmp = isHighWaterSensorDry() [L353] COND FALSE !(\read(tmp)) [L356] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L358] retValue_acc = tmp___0 [L359] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L201] tmp = isHighWaterLevel() [L203] COND TRUE \read(tmp) [L276] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L608] int tmp ; [L609] int tmp___0 ; [L438] int retValue_acc ; [L441] retValue_acc = methaneLevelCritical [L442] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L613] tmp = isMethaneLevelCritical() [L615] COND TRUE \read(tmp) [L300] int retValue_acc ; [L303] retValue_acc = pumpRunning [L304] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L617] tmp___0 = isPumpRunning() [L619] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L506] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 191 locations, 3 error locations. UNSAFE Result, 6.9s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1183 SDtfs, 1480 SDslu, 1720 SDs, 0 SdLazy, 217 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 743 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 15338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...