./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product44_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec1_product44_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 b18fc9f0044b48e81511337a91deb94a0dfeec26 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:46:27,165 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:46:27,166 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:46:27,180 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:46:27,181 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:46:27,182 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:46:27,183 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:46:27,185 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:46:27,187 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:46:27,187 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:46:27,188 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:46:27,189 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:46:27,190 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:46:27,191 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:46:27,192 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:46:27,193 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:46:27,194 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:46:27,196 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:46:27,198 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:46:27,200 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:46:27,201 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:46:27,202 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:46:27,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:46:27,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:46:27,205 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:46:27,206 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:46:27,207 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:46:27,208 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:46:27,209 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:46:27,210 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:46:27,211 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:46:27,211 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:46:27,212 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:46:27,212 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:46:27,213 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:46:27,214 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:46:27,214 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:46:27,241 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:46:27,244 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:46:27,247 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:46:27,248 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:46:27,248 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:46:27,248 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:46:27,248 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:46:27,249 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:46:27,249 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:46:27,249 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:46:27,249 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:46:27,249 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:46:27,249 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:46:27,250 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:46:27,251 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:46:27,251 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:46:27,251 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:46:27,252 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:46:27,252 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:46:27,252 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:46:27,252 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:46:27,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:46:27,252 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:46:27,254 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:46:27,254 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:46:27,254 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:46:27,254 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:46:27,255 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:46:27,255 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 -> b18fc9f0044b48e81511337a91deb94a0dfeec26 [2019-01-12 14:46:27,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:46:27,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:46:27,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:46:27,329 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:46:27,330 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:46:27,330 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product44_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:27,391 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b8334a6d/2905d4b10cf44099a04b9831c641a652/FLAGb290e426d [2019-01-12 14:46:27,933 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:46:27,934 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product44_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:27,951 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b8334a6d/2905d4b10cf44099a04b9831c641a652/FLAGb290e426d [2019-01-12 14:46:28,230 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b8334a6d/2905d4b10cf44099a04b9831c641a652 [2019-01-12 14:46:28,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:46:28,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:46:28,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:46:28,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:46:28,240 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:46:28,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:46:28" (1/1) ... [2019-01-12 14:46:28,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae2106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:28, skipping insertion in model container [2019-01-12 14:46:28,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:46:28" (1/1) ... [2019-01-12 14:46:28,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:46:28,323 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:46:28,783 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:46:28,798 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:46:29,008 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:46:29,054 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:46:29,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:29 WrapperNode [2019-01-12 14:46:29,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:46:29,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:46:29,056 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:46:29,056 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:46:29,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:29" (1/1) ... [2019-01-12 14:46:29,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:29" (1/1) ... [2019-01-12 14:46:29,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:46:29,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:46:29,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:46:29,139 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:46:29,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:29" (1/1) ... [2019-01-12 14:46:29,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:29" (1/1) ... [2019-01-12 14:46:29,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:29" (1/1) ... [2019-01-12 14:46:29,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:29" (1/1) ... [2019-01-12 14:46:29,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:29" (1/1) ... [2019-01-12 14:46:29,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:29" (1/1) ... [2019-01-12 14:46:29,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:29" (1/1) ... [2019-01-12 14:46:29,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:46:29,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:46:29,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:46:29,181 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:46:29,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:46:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:46:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:46:29,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:46:29,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:46:30,508 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:46:30,509 INFO L286 CfgBuilder]: Removed 120 assue(true) statements. [2019-01-12 14:46:30,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:30 BoogieIcfgContainer [2019-01-12 14:46:30,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:46:30,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:46:30,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:46:30,516 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:46:30,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:46:28" (1/3) ... [2019-01-12 14:46:30,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ca4874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:46:30, skipping insertion in model container [2019-01-12 14:46:30,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:29" (2/3) ... [2019-01-12 14:46:30,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ca4874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:46:30, skipping insertion in model container [2019-01-12 14:46:30,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:30" (3/3) ... [2019-01-12 14:46:30,521 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product44_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:30,530 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:46:30,539 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:46:30,556 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:46:30,588 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:46:30,589 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:46:30,589 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:46:30,589 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:46:30,590 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:46:30,590 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:46:30,590 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:46:30,590 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:46:30,590 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:46:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-01-12 14:46:30,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:46:30,616 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:30,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:30,620 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:30,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:30,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1782116946, now seen corresponding path program 1 times [2019-01-12 14:46:30,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:30,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:30,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:30,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:30,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:30,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:30,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:30,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:46:30,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:46:30,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:46:30,903 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 2 states. [2019-01-12 14:46:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:30,942 INFO L93 Difference]: Finished difference Result 172 states and 257 transitions. [2019-01-12 14:46:30,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:46:30,944 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:46:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:30,956 INFO L225 Difference]: With dead ends: 172 [2019-01-12 14:46:30,956 INFO L226 Difference]: Without dead ends: 85 [2019-01-12 14:46:30,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:46:30,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-12 14:46:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-12 14:46:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-12 14:46:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2019-01-12 14:46:31,004 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 16 [2019-01-12 14:46:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:31,004 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2019-01-12 14:46:31,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:46:31,005 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2019-01-12 14:46:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:46:31,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:31,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:31,006 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:31,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:31,008 INFO L82 PathProgramCache]: Analyzing trace with hash 735360049, now seen corresponding path program 1 times [2019-01-12 14:46:31,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:31,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:31,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:31,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:31,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:31,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:31,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:46:31,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:31,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:31,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:31,199 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand 3 states. [2019-01-12 14:46:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:31,228 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2019-01-12 14:46:31,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:31,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:46:31,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:31,232 INFO L225 Difference]: With dead ends: 85 [2019-01-12 14:46:31,232 INFO L226 Difference]: Without dead ends: 39 [2019-01-12 14:46:31,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:31,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-12 14:46:31,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-12 14:46:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-12 14:46:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-01-12 14:46:31,240 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 17 [2019-01-12 14:46:31,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:31,240 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-01-12 14:46:31,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:31,241 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-01-12 14:46:31,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:46:31,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:31,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:31,243 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:31,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:31,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1297648259, now seen corresponding path program 1 times [2019-01-12 14:46:31,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:31,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:31,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:31,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:31,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:31,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:31,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:46:31,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:31,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:31,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:31,414 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 5 states. [2019-01-12 14:46:31,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:31,566 INFO L93 Difference]: Finished difference Result 95 states and 138 transitions. [2019-01-12 14:46:31,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:46:31,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-12 14:46:31,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:31,570 INFO L225 Difference]: With dead ends: 95 [2019-01-12 14:46:31,570 INFO L226 Difference]: Without dead ends: 62 [2019-01-12 14:46:31,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:46:31,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-12 14:46:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2019-01-12 14:46:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-12 14:46:31,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2019-01-12 14:46:31,584 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 22 [2019-01-12 14:46:31,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:31,584 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2019-01-12 14:46:31,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2019-01-12 14:46:31,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 14:46:31,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:31,587 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] [2019-01-12 14:46:31,587 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:31,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:31,587 INFO L82 PathProgramCache]: Analyzing trace with hash -372126526, now seen corresponding path program 1 times [2019-01-12 14:46:31,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:31,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:31,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:31,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:31,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:31,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:31,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:31,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:31,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:31,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:31,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:31,699 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 3 states. [2019-01-12 14:46:31,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:31,771 INFO L93 Difference]: Finished difference Result 131 states and 192 transitions. [2019-01-12 14:46:31,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:31,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-12 14:46:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:31,774 INFO L225 Difference]: With dead ends: 131 [2019-01-12 14:46:31,774 INFO L226 Difference]: Without dead ends: 79 [2019-01-12 14:46:31,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:31,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-12 14:46:31,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-01-12 14:46:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-12 14:46:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2019-01-12 14:46:31,786 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 23 [2019-01-12 14:46:31,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:31,786 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2019-01-12 14:46:31,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:31,787 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2019-01-12 14:46:31,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:46:31,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:31,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:31,789 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:31,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:31,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1852423790, now seen corresponding path program 1 times [2019-01-12 14:46:31,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:31,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:31,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:31,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:31,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:31,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:31,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:31,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:31,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:31,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:31,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:31,950 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand 5 states. [2019-01-12 14:46:32,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:32,214 INFO L93 Difference]: Finished difference Result 371 states and 539 transitions. [2019-01-12 14:46:32,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:46:32,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-01-12 14:46:32,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:32,219 INFO L225 Difference]: With dead ends: 371 [2019-01-12 14:46:32,219 INFO L226 Difference]: Without dead ends: 300 [2019-01-12 14:46:32,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:46:32,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-12 14:46:32,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 140. [2019-01-12 14:46:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-01-12 14:46:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 196 transitions. [2019-01-12 14:46:32,249 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 196 transitions. Word has length 25 [2019-01-12 14:46:32,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:32,249 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 196 transitions. [2019-01-12 14:46:32,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 196 transitions. [2019-01-12 14:46:32,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 14:46:32,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:32,252 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] [2019-01-12 14:46:32,252 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:32,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:32,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2056230884, now seen corresponding path program 1 times [2019-01-12 14:46:32,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:32,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:32,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:32,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:32,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:32,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:32,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:32,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:32,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:32,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:32,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:32,473 INFO L87 Difference]: Start difference. First operand 140 states and 196 transitions. Second operand 5 states. [2019-01-12 14:46:33,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:33,483 INFO L93 Difference]: Finished difference Result 392 states and 553 transitions. [2019-01-12 14:46:33,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:46:33,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-01-12 14:46:33,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:33,488 INFO L225 Difference]: With dead ends: 392 [2019-01-12 14:46:33,488 INFO L226 Difference]: Without dead ends: 390 [2019-01-12 14:46:33,489 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 [2019-01-12 14:46:33,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-01-12 14:46:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 140. [2019-01-12 14:46:33,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-01-12 14:46:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-01-12 14:46:33,523 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 26 [2019-01-12 14:46:33,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:33,523 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-01-12 14:46:33,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-01-12 14:46:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:46:33,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:33,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:33,527 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:33,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:33,528 INFO L82 PathProgramCache]: Analyzing trace with hash 437867349, now seen corresponding path program 1 times [2019-01-12 14:46:33,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:33,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:33,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:33,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:33,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:33,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:33,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:46:33,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:33,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:33,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:33,799 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 5 states. [2019-01-12 14:46:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:34,057 INFO L93 Difference]: Finished difference Result 426 states and 588 transitions. [2019-01-12 14:46:34,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:46:34,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-01-12 14:46:34,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:34,061 INFO L225 Difference]: With dead ends: 426 [2019-01-12 14:46:34,061 INFO L226 Difference]: Without dead ends: 292 [2019-01-12 14:46:34,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:46:34,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-01-12 14:46:34,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 146. [2019-01-12 14:46:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-12 14:46:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2019-01-12 14:46:34,093 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 200 transitions. Word has length 33 [2019-01-12 14:46:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:34,093 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 200 transitions. [2019-01-12 14:46:34,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:34,095 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 200 transitions. [2019-01-12 14:46:34,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:46:34,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:34,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:34,098 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:34,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:34,098 INFO L82 PathProgramCache]: Analyzing trace with hash -148938665, now seen corresponding path program 1 times [2019-01-12 14:46:34,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:34,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:34,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:34,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:34,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:34,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:34,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:34,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:46:34,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:46:34,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:46:34,263 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. Second operand 4 states. [2019-01-12 14:46:34,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:34,394 INFO L93 Difference]: Finished difference Result 370 states and 506 transitions. [2019-01-12 14:46:34,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:46:34,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-01-12 14:46:34,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:34,398 INFO L225 Difference]: With dead ends: 370 [2019-01-12 14:46:34,398 INFO L226 Difference]: Without dead ends: 230 [2019-01-12 14:46:34,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:34,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-12 14:46:34,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 150. [2019-01-12 14:46:34,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-12 14:46:34,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 204 transitions. [2019-01-12 14:46:34,439 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 204 transitions. Word has length 33 [2019-01-12 14:46:34,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:34,439 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 204 transitions. [2019-01-12 14:46:34,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:46:34,439 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 204 transitions. [2019-01-12 14:46:34,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:46:34,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:34,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:34,448 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:34,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:34,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1428802343, now seen corresponding path program 1 times [2019-01-12 14:46:34,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:34,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:34,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:34,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:34,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:34,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:34,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:34,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:34,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:34,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:34,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:34,542 INFO L87 Difference]: Start difference. First operand 150 states and 204 transitions. Second operand 3 states. [2019-01-12 14:46:34,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:34,654 INFO L93 Difference]: Finished difference Result 380 states and 516 transitions. [2019-01-12 14:46:34,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:34,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-01-12 14:46:34,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:34,658 INFO L225 Difference]: With dead ends: 380 [2019-01-12 14:46:34,658 INFO L226 Difference]: Without dead ends: 236 [2019-01-12 14:46:34,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:34,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-01-12 14:46:34,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2019-01-12 14:46:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-12 14:46:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 312 transitions. [2019-01-12 14:46:34,709 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 312 transitions. Word has length 33 [2019-01-12 14:46:34,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:34,710 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 312 transitions. [2019-01-12 14:46:34,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:34,710 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 312 transitions. [2019-01-12 14:46:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 14:46:34,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:34,713 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, 1] [2019-01-12 14:46:34,714 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:34,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:34,714 INFO L82 PathProgramCache]: Analyzing trace with hash -271506405, now seen corresponding path program 1 times [2019-01-12 14:46:34,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:34,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:34,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:34,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:34,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:35,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:35,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:35,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:46:35,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:46:35,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:46:35,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:46:35,100 INFO L87 Difference]: Start difference. First operand 236 states and 312 transitions. Second operand 6 states. [2019-01-12 14:46:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:35,891 INFO L93 Difference]: Finished difference Result 726 states and 964 transitions. [2019-01-12 14:46:35,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 14:46:35,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-01-12 14:46:35,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:35,895 INFO L225 Difference]: With dead ends: 726 [2019-01-12 14:46:35,896 INFO L226 Difference]: Without dead ends: 496 [2019-01-12 14:46:35,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:46:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-01-12 14:46:35,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 236. [2019-01-12 14:46:35,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-12 14:46:35,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 306 transitions. [2019-01-12 14:46:35,934 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 306 transitions. Word has length 34 [2019-01-12 14:46:35,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:35,934 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 306 transitions. [2019-01-12 14:46:35,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:46:35,936 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 306 transitions. [2019-01-12 14:46:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 14:46:35,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:35,937 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:35,938 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:35,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:35,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1907454321, now seen corresponding path program 1 times [2019-01-12 14:46:35,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:35,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:35,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:35,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:35,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:46:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:46:36,757 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:46:36,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:46:36 BoogieIcfgContainer [2019-01-12 14:46:36,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:46:36,978 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:46:36,978 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:46:36,979 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:46:36,979 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:30" (3/4) ... [2019-01-12 14:46:36,984 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:46:37,159 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:46:37,159 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:46:37,161 INFO L168 Benchmark]: Toolchain (without parser) took 8926.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 948.7 MB in the beginning and 957.4 MB in the end (delta: -8.7 MB). Peak memory consumption was 201.5 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:37,162 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:46:37,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -179.5 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:37,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:37,164 INFO L168 Benchmark]: Boogie Preprocessor took 42.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:46:37,164 INFO L168 Benchmark]: RCFGBuilder took 1329.24 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. [2019-01-12 14:46:37,166 INFO L168 Benchmark]: TraceAbstraction took 6465.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 980.8 MB in the end (delta: 82.6 MB). Peak memory consumption was 152.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:37,166 INFO L168 Benchmark]: Witness Printer took 180.85 ms. Allocated memory is still 1.2 GB. Free memory was 980.8 MB in the beginning and 957.4 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:37,169 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 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 818.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -179.5 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.63 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 42.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1329.24 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 6465.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 980.8 MB in the end (delta: 82.6 MB). Peak memory consumption was 152.4 MB. Max. memory is 11.5 GB. * Witness Printer took 180.85 ms. Allocated memory is still 1.2 GB. Free memory was 980.8 MB in the beginning and 957.4 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 44]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L218] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L498] int pumpRunning = 0; [L499] int systemActive = 1; [L693] int waterLevel = 1; [L694] int methaneLevelCritical = 0; [L851] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L924] int retValue_acc ; [L925] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L842] int retValue_acc ; [L845] retValue_acc = 1 [L846] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L931] tmp = valid_product() [L933] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L422] int splverifierCounter ; [L423] int tmp ; [L424] int tmp___0 ; [L425] int tmp___1 ; [L426] int tmp___2 ; [L429] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L431] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L433] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L439] tmp = __VERIFIER_nondet_int() [L441] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L711] COND TRUE waterLevel < 2 [L712] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L449] tmp___0 = __VERIFIER_nondet_int() [L451] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L459] tmp___2 = __VERIFIER_nondet_int() [L461] COND TRUE \read(tmp___2) [L687] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L506] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L513] COND TRUE \read(systemActive) [L535] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L538] COND TRUE ! pumpRunning [L650] int retValue_acc ; [L651] int tmp ; [L652] int tmp___0 ; [L773] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L776] COND FALSE !(waterLevel < 2) [L780] retValue_acc = 0 [L781] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L656] tmp = isHighWaterSensorDry() [L658] COND FALSE !(\read(tmp)) [L661] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L663] retValue_acc = tmp___0 [L664] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L540] tmp = isHighWaterLevel() [L542] COND TRUE \read(tmp) [L569] int tmp ; [L594] int retValue_acc ; [L732] int retValue_acc ; [L735] retValue_acc = methaneLevelCritical [L736] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L598] retValue_acc = isMethaneLevelCritical() [L600] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L573] tmp = isMethaneAlarm() [L575] COND FALSE !(\read(tmp)) [L563] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L788] int tmp ; [L789] int tmp___0 ; [L732] int retValue_acc ; [L735] retValue_acc = methaneLevelCritical [L736] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L793] tmp = isMethaneLevelCritical() [L795] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L431] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L433] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L439] tmp = __VERIFIER_nondet_int() [L441] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L449] tmp___0 = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L723] COND FALSE !(\read(methaneLevelCritical)) [L726] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L459] tmp___2 = __VERIFIER_nondet_int() [L461] COND TRUE \read(tmp___2) [L687] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L506] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L699] COND TRUE waterLevel > 0 [L700] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L513] COND TRUE \read(systemActive) [L535] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L538] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L788] int tmp ; [L789] int tmp___0 ; [L732] int retValue_acc ; [L735] retValue_acc = methaneLevelCritical [L736] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L793] tmp = isMethaneLevelCritical() [L795] COND TRUE \read(tmp) [L605] int retValue_acc ; [L608] retValue_acc = pumpRunning [L609] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L797] tmp___0 = isPumpRunning() [L799] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L44] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 89 locations, 3 error locations. UNSAFE Result, 6.3s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 821 SDtfs, 1204 SDslu, 1337 SDs, 0 SdLazy, 175 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred 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, 10 MinimizatonAttempts, 902 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 12350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...