./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product43_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_product43_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 63b48aee14c7431a4aa25f8de4f2dd8129d50ad4 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:34,190 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:41:34,192 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:41:34,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:41:34,204 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:41:34,205 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:41:34,207 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:41:34,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:41:34,211 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:41:34,212 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:41:34,213 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:41:34,213 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:41:34,214 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:41:34,216 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:41:34,217 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:41:34,218 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:41:34,219 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:41:34,221 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:41:34,223 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:41:34,225 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:41:34,226 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:41:34,227 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:41:34,230 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:41:34,230 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:41:34,231 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:41:34,232 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:41:34,233 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:41:34,234 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:41:34,235 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:41:34,236 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:41:34,236 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:41:34,238 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:41:34,238 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:41:34,238 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:41:34,239 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:41:34,240 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:41:34,240 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:34,256 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:41:34,256 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:41:34,258 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:41:34,258 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:41:34,258 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:41:34,258 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:41:34,258 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:41:34,259 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:41:34,259 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:41:34,260 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:41:34,260 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:41:34,260 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:41:34,260 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:41:34,260 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:41:34,260 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:41:34,261 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:41:34,262 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:41:34,262 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:41:34,262 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:41:34,262 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:41:34,262 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:41:34,262 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:41:34,263 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:41:34,263 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:41:34,263 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:41:34,263 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:41:34,265 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:41:34,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:41:34,265 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 -> 63b48aee14c7431a4aa25f8de4f2dd8129d50ad4 [2018-12-31 09:41:34,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:41:34,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:41:34,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:41:34,347 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:41:34,348 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:41:34,348 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product43_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:34,424 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbd55b03b/2e2534ecc63144df8b8204a6ede9e52d/FLAG194d9dbba [2018-12-31 09:41:35,022 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:41:35,022 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product43_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:35,034 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbd55b03b/2e2534ecc63144df8b8204a6ede9e52d/FLAG194d9dbba [2018-12-31 09:41:35,268 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbd55b03b/2e2534ecc63144df8b8204a6ede9e52d [2018-12-31 09:41:35,272 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:41:35,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:41:35,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:41:35,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:41:35,282 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:41:35,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:41:35" (1/1) ... [2018-12-31 09:41:35,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3277d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:35, skipping insertion in model container [2018-12-31 09:41:35,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:41:35" (1/1) ... [2018-12-31 09:41:35,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:41:35,359 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:41:35,767 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:41:35,783 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:41:35,879 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:41:36,005 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:41:36,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:36 WrapperNode [2018-12-31 09:41:36,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:41:36,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:41:36,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:41:36,007 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:41:36,016 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:36" (1/1) ... [2018-12-31 09:41:36,035 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:36" (1/1) ... [2018-12-31 09:41:36,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:41:36,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:41:36,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:41:36,084 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:41:36,099 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:36" (1/1) ... [2018-12-31 09:41:36,100 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:36" (1/1) ... [2018-12-31 09:41:36,109 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:36" (1/1) ... [2018-12-31 09:41:36,113 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:36" (1/1) ... [2018-12-31 09:41:36,131 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:36" (1/1) ... [2018-12-31 09:41:36,149 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:36" (1/1) ... [2018-12-31 09:41:36,156 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:36" (1/1) ... [2018-12-31 09:41:36,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:41:36,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:41:36,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:41:36,168 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:41:36,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:36" (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:36,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:41:36,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:41:36,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:41:36,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:41:37,488 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:41:37,488 INFO L280 CfgBuilder]: Removed 118 assue(true) statements. [2018-12-31 09:41:37,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:37 BoogieIcfgContainer [2018-12-31 09:41:37,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:41:37,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:41:37,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:41:37,494 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:41:37,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:41:35" (1/3) ... [2018-12-31 09:41:37,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45774db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:41:37, skipping insertion in model container [2018-12-31 09:41:37,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:36" (2/3) ... [2018-12-31 09:41:37,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45774db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:41:37, skipping insertion in model container [2018-12-31 09:41:37,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:37" (3/3) ... [2018-12-31 09:41:37,498 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product43_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:37,508 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:41:37,517 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:41:37,535 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:41:37,567 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:41:37,568 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:41:37,568 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:41:37,568 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:41:37,568 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:41:37,569 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:41:37,569 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:41:37,569 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:41:37,569 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:41:37,588 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-12-31 09:41:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:41:37,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:37,597 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:37,599 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:37,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:37,606 INFO L82 PathProgramCache]: Analyzing trace with hash 929673937, now seen corresponding path program 1 times [2018-12-31 09:41:37,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:37,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:37,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:37,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:37,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:37,910 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:37,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:37,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:37,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:41:37,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:41:37,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:41:37,930 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 2 states. [2018-12-31 09:41:37,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:37,959 INFO L93 Difference]: Finished difference Result 172 states and 257 transitions. [2018-12-31 09:41:37,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:41:37,961 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:41:37,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:37,974 INFO L225 Difference]: With dead ends: 172 [2018-12-31 09:41:37,975 INFO L226 Difference]: Without dead ends: 85 [2018-12-31 09:41:37,978 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:37,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-31 09:41:38,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-31 09:41:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-31 09:41:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2018-12-31 09:41:38,028 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 16 [2018-12-31 09:41:38,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:38,029 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2018-12-31 09:41:38,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:41:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2018-12-31 09:41:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:41:38,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:38,030 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:38,031 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:38,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:38,031 INFO L82 PathProgramCache]: Analyzing trace with hash -117082960, now seen corresponding path program 1 times [2018-12-31 09:41:38,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:38,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:38,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:38,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:38,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:38,175 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:38,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:38,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:41:38,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:38,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:38,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:38,180 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand 3 states. [2018-12-31 09:41:38,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:38,218 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2018-12-31 09:41:38,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:38,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:41:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:38,220 INFO L225 Difference]: With dead ends: 85 [2018-12-31 09:41:38,221 INFO L226 Difference]: Without dead ends: 39 [2018-12-31 09:41:38,222 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:38,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-31 09:41:38,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-31 09:41:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-31 09:41:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2018-12-31 09:41:38,235 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 17 [2018-12-31 09:41:38,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:38,235 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2018-12-31 09:41:38,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2018-12-31 09:41:38,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:41:38,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:38,237 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:38,240 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:38,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:38,240 INFO L82 PathProgramCache]: Analyzing trace with hash 337421565, now seen corresponding path program 1 times [2018-12-31 09:41:38,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:38,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:38,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:38,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:38,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:38,596 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:38,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:38,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:41:38,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:41:38,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:41:38,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:41:38,598 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 6 states. [2018-12-31 09:41:38,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:38,806 INFO L93 Difference]: Finished difference Result 128 states and 187 transitions. [2018-12-31 09:41:38,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:41:38,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-31 09:41:38,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:38,811 INFO L225 Difference]: With dead ends: 128 [2018-12-31 09:41:38,811 INFO L226 Difference]: Without dead ends: 95 [2018-12-31 09:41:38,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:41:38,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-31 09:41:38,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 58. [2018-12-31 09:41:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-31 09:41:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2018-12-31 09:41:38,825 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 22 [2018-12-31 09:41:38,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:38,825 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2018-12-31 09:41:38,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:41:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2018-12-31 09:41:38,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 09:41:38,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:38,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:38,827 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:38,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:38,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1224569535, now seen corresponding path program 1 times [2018-12-31 09:41:38,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:38,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:38,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:38,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:38,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:38,911 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:38,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:38,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:38,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:38,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:38,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:38,913 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 3 states. [2018-12-31 09:41:39,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:39,117 INFO L93 Difference]: Finished difference Result 131 states and 192 transitions. [2018-12-31 09:41:39,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:39,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-31 09:41:39,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:39,119 INFO L225 Difference]: With dead ends: 131 [2018-12-31 09:41:39,119 INFO L226 Difference]: Without dead ends: 79 [2018-12-31 09:41:39,120 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:39,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-31 09:41:39,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-12-31 09:41:39,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-31 09:41:39,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2018-12-31 09:41:39,135 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 23 [2018-12-31 09:41:39,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:39,135 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2018-12-31 09:41:39,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:39,136 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2018-12-31 09:41:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:41:39,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:39,137 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:39,137 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:39,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:39,138 INFO L82 PathProgramCache]: Analyzing trace with hash -840484654, now seen corresponding path program 1 times [2018-12-31 09:41:39,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:39,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:39,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:39,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:39,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:39,311 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:39,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:39,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:39,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:39,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:39,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:39,312 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand 5 states. [2018-12-31 09:41:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:39,722 INFO L93 Difference]: Finished difference Result 371 states and 539 transitions. [2018-12-31 09:41:39,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:41:39,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-31 09:41:39,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:39,727 INFO L225 Difference]: With dead ends: 371 [2018-12-31 09:41:39,729 INFO L226 Difference]: Without dead ends: 300 [2018-12-31 09:41:39,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:41:39,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-12-31 09:41:39,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 140. [2018-12-31 09:41:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-31 09:41:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 196 transitions. [2018-12-31 09:41:39,782 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 196 transitions. Word has length 25 [2018-12-31 09:41:39,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:39,782 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 196 transitions. [2018-12-31 09:41:39,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 196 transitions. [2018-12-31 09:41:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 09:41:39,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:39,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:39,785 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:39,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:39,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1044291748, now seen corresponding path program 1 times [2018-12-31 09:41:39,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:39,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:39,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:39,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:39,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:39,940 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:39,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:39,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:39,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:39,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:39,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:39,943 INFO L87 Difference]: Start difference. First operand 140 states and 196 transitions. Second operand 5 states. [2018-12-31 09:41:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:40,838 INFO L93 Difference]: Finished difference Result 392 states and 553 transitions. [2018-12-31 09:41:40,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:41:40,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-31 09:41:40,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:40,842 INFO L225 Difference]: With dead ends: 392 [2018-12-31 09:41:40,842 INFO L226 Difference]: Without dead ends: 390 [2018-12-31 09:41:40,843 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:40,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-12-31 09:41:40,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 140. [2018-12-31 09:41:40,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-31 09:41:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2018-12-31 09:41:40,885 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 26 [2018-12-31 09:41:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:40,885 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2018-12-31 09:41:40,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2018-12-31 09:41:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 09:41:40,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:40,889 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:40,889 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:40,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:40,889 INFO L82 PathProgramCache]: Analyzing trace with hash 895513141, now seen corresponding path program 1 times [2018-12-31 09:41:40,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:40,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:40,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:40,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:40,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:41,159 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:41,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:41,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:41:41,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:41,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:41,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:41,161 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 5 states. [2018-12-31 09:41:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:41,460 INFO L93 Difference]: Finished difference Result 426 states and 588 transitions. [2018-12-31 09:41:41,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:41:41,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-12-31 09:41:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:41,463 INFO L225 Difference]: With dead ends: 426 [2018-12-31 09:41:41,463 INFO L226 Difference]: Without dead ends: 292 [2018-12-31 09:41:41,464 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:41,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-12-31 09:41:41,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 146. [2018-12-31 09:41:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-31 09:41:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2018-12-31 09:41:41,492 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 200 transitions. Word has length 33 [2018-12-31 09:41:41,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:41,493 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 200 transitions. [2018-12-31 09:41:41,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:41,493 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 200 transitions. [2018-12-31 09:41:41,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 09:41:41,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:41,495 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:41,495 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:41,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:41,496 INFO L82 PathProgramCache]: Analyzing trace with hash 308707127, now seen corresponding path program 1 times [2018-12-31 09:41:41,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:41,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:41,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:41,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:41,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:41,801 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:41,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:41,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:41:41,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:41:41,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:41:41,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:41:41,804 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. Second operand 6 states. [2018-12-31 09:41:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:41,960 INFO L93 Difference]: Finished difference Result 444 states and 606 transitions. [2018-12-31 09:41:41,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:41:41,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-12-31 09:41:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:41,963 INFO L225 Difference]: With dead ends: 444 [2018-12-31 09:41:41,963 INFO L226 Difference]: Without dead ends: 304 [2018-12-31 09:41:41,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:41:41,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-12-31 09:41:41,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 150. [2018-12-31 09:41:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-31 09:41:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 204 transitions. [2018-12-31 09:41:41,994 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 204 transitions. Word has length 33 [2018-12-31 09:41:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:41,994 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 204 transitions. [2018-12-31 09:41:41,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:41:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 204 transitions. [2018-12-31 09:41:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 09:41:41,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:41,996 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:41,996 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:41,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:41,997 INFO L82 PathProgramCache]: Analyzing trace with hash -971156551, now seen corresponding path program 1 times [2018-12-31 09:41:41,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:41,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:42,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:42,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:42,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:42,082 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:42,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:42,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:42,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:42,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:42,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:42,085 INFO L87 Difference]: Start difference. First operand 150 states and 204 transitions. Second operand 3 states. [2018-12-31 09:41:42,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:42,266 INFO L93 Difference]: Finished difference Result 380 states and 516 transitions. [2018-12-31 09:41:42,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:42,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-31 09:41:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:42,270 INFO L225 Difference]: With dead ends: 380 [2018-12-31 09:41:42,271 INFO L226 Difference]: Without dead ends: 236 [2018-12-31 09:41:42,271 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:42,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-12-31 09:41:42,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2018-12-31 09:41:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-12-31 09:41:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 312 transitions. [2018-12-31 09:41:42,323 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 312 transitions. Word has length 33 [2018-12-31 09:41:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:42,325 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 312 transitions. [2018-12-31 09:41:42,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:42,326 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 312 transitions. [2018-12-31 09:41:42,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 09:41:42,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:42,331 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] [2018-12-31 09:41:42,331 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:42,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:42,332 INFO L82 PathProgramCache]: Analyzing trace with hash 186139387, now seen corresponding path program 1 times [2018-12-31 09:41:42,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:42,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:42,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:42,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:42,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:42,554 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:42,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:42,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 09:41:42,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:41:42,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:41:42,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:41:42,556 INFO L87 Difference]: Start difference. First operand 236 states and 312 transitions. Second operand 8 states. [2018-12-31 09:41:43,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:43,729 INFO L93 Difference]: Finished difference Result 874 states and 1160 transitions. [2018-12-31 09:41:43,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 09:41:43,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-12-31 09:41:43,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:43,733 INFO L225 Difference]: With dead ends: 874 [2018-12-31 09:41:43,733 INFO L226 Difference]: Without dead ends: 644 [2018-12-31 09:41:43,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2018-12-31 09:41:43,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-12-31 09:41:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 236. [2018-12-31 09:41:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-12-31 09:41:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 306 transitions. [2018-12-31 09:41:43,781 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 306 transitions. Word has length 34 [2018-12-31 09:41:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:43,782 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 306 transitions. [2018-12-31 09:41:43,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:41:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 306 transitions. [2018-12-31 09:41:43,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 09:41:43,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:43,783 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] [2018-12-31 09:41:43,784 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:43,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:43,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1466712466, now seen corresponding path program 1 times [2018-12-31 09:41:43,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:43,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:43,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:43,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:43,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:41:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:41:44,514 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:41:44,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:41:44 BoogieIcfgContainer [2018-12-31 09:41:44,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:41:44,684 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:41:44,685 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:41:44,686 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:41:44,687 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:37" (3/4) ... [2018-12-31 09:41:44,690 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:41:44,881 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:41:44,882 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:41:44,883 INFO L168 Benchmark]: Toolchain (without parser) took 9610.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 954.0 MB in the beginning and 870.6 MB in the end (delta: 83.5 MB). Peak memory consumption was 246.0 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:44,885 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:41:44,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 66.1 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -97.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:44,885 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.42 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:44,886 INFO L168 Benchmark]: Boogie Preprocessor took 80.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:41:44,886 INFO L168 Benchmark]: RCFGBuilder took 1324.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 989.1 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:44,886 INFO L168 Benchmark]: TraceAbstraction took 7193.90 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 96.5 MB). Free memory was 989.1 MB in the beginning and 888.1 MB in the end (delta: 101.1 MB). Peak memory consumption was 197.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:44,887 INFO L168 Benchmark]: Witness Printer took 197.62 ms. Allocated memory is still 1.2 GB. Free memory was 888.1 MB in the beginning and 870.6 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:44,889 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 728.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 66.1 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -97.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.42 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1324.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 989.1 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7193.90 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 96.5 MB). Free memory was 989.1 MB in the beginning and 888.1 MB in the end (delta: 101.1 MB). Peak memory consumption was 197.5 MB. Max. memory is 11.5 GB. * Witness Printer took 197.62 ms. Allocated memory is still 1.2 GB. Free memory was 888.1 MB in the beginning and 870.6 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 405]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L147] int pumpRunning = 0; [L148] int systemActive = 1; [L436] int cleanupTimeShifts = 4; [L704] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L512] int retValue_acc ; [L513] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L927] int retValue_acc ; [L930] retValue_acc = 1 [L931] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L519] tmp = valid_product() [L521] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L335] int splverifierCounter ; [L336] int tmp ; [L337] int tmp___0 ; [L338] int tmp___1 ; [L339] int tmp___2 ; [L342] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L344] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L346] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L352] tmp = __VERIFIER_nondet_int() [L354] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L65] COND TRUE waterLevel < 2 [L66] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L362] tmp___0 = __VERIFIER_nondet_int() [L364] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L372] tmp___2 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L155] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L162] COND TRUE \read(systemActive) [L184] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L187] COND TRUE ! pumpRunning [L299] int retValue_acc ; [L300] int tmp ; [L301] int tmp___0 ; [L127] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L130] COND FALSE !(waterLevel < 2) [L134] retValue_acc = 0 [L135] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L305] tmp = isHighWaterSensorDry() [L307] COND FALSE !(\read(tmp)) [L310] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L312] retValue_acc = tmp___0 [L313] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L189] tmp = isHighWaterLevel() [L191] COND TRUE \read(tmp) [L218] int tmp ; [L243] int retValue_acc ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L247] retValue_acc = isMethaneLevelCritical() [L249] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L222] tmp = isMethaneAlarm() [L224] COND FALSE !(\read(tmp)) [L212] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L411] int tmp ; [L412] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L416] tmp = isMethaneLevelCritical() [L418] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L344] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L346] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L352] tmp = __VERIFIER_nondet_int() [L354] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L362] tmp___0 = __VERIFIER_nondet_int() [L364] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L77] COND FALSE !(\read(methaneLevelCritical)) [L80] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L372] tmp___2 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L155] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L53] COND TRUE waterLevel > 0 [L54] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L162] COND TRUE \read(systemActive) [L184] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L187] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L411] int tmp ; [L412] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L416] tmp = isMethaneLevelCritical() [L418] COND TRUE \read(tmp) [L254] int retValue_acc ; [L257] retValue_acc = pumpRunning [L258] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L420] tmp___0 = isPumpRunning() [L422] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L405] __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, 7.1s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 870 SDtfs, 1375 SDslu, 1757 SDs, 0 SdLazy, 219 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.4s 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.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1157 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 13787 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...