./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product54_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_product54_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 72d06b83689108b06d89f4f95641f29fdbb51231 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:48,426 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:41:48,431 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:41:48,443 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:41:48,443 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:41:48,444 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:41:48,446 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:41:48,447 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:41:48,449 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:41:48,450 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:41:48,451 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:41:48,451 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:41:48,452 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:41:48,453 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:41:48,454 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:41:48,454 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:41:48,455 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:41:48,457 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:41:48,459 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:41:48,460 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:41:48,461 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:41:48,463 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:41:48,465 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:41:48,465 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:41:48,466 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:41:48,467 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:41:48,468 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:41:48,468 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:41:48,469 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:41:48,470 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:41:48,471 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:41:48,472 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:41:48,472 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:41:48,473 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:41:48,475 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:41:48,477 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:41:48,479 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:48,494 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:41:48,495 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:41:48,496 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:41:48,496 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:41:48,496 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:41:48,497 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:41:48,497 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:41:48,497 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:41:48,497 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:41:48,497 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:41:48,498 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:41:48,498 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:41:48,499 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:41:48,499 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:41:48,499 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:41:48,499 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:41:48,499 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:41:48,500 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:41:48,501 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:41:48,501 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:41:48,501 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:41:48,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:41:48,501 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:41:48,501 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:41:48,502 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:41:48,502 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:41:48,502 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:41:48,502 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:41:48,502 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 -> 72d06b83689108b06d89f4f95641f29fdbb51231 [2018-12-31 09:41:48,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:41:48,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:41:48,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:41:48,558 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:41:48,558 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:41:48,559 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product54_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:48,618 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/092c36a1f/acb3d4a064d445baabf6c200f2b231f0/FLAG3081f9f46 [2018-12-31 09:41:49,155 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:41:49,156 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product54_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:49,169 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/092c36a1f/acb3d4a064d445baabf6c200f2b231f0/FLAG3081f9f46 [2018-12-31 09:41:49,411 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/092c36a1f/acb3d4a064d445baabf6c200f2b231f0 [2018-12-31 09:41:49,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:41:49,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:41:49,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:41:49,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:41:49,422 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:41:49,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:41:49" (1/1) ... [2018-12-31 09:41:49,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ad8311d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:49, skipping insertion in model container [2018-12-31 09:41:49,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:41:49" (1/1) ... [2018-12-31 09:41:49,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:41:49,487 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:41:49,863 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:41:49,893 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:41:50,018 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:41:50,141 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:41:50,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50 WrapperNode [2018-12-31 09:41:50,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:41:50,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:41:50,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:41:50,143 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:41:50,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (1/1) ... [2018-12-31 09:41:50,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (1/1) ... [2018-12-31 09:41:50,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:41:50,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:41:50,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:41:50,242 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:41:50,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (1/1) ... [2018-12-31 09:41:50,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (1/1) ... [2018-12-31 09:41:50,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (1/1) ... [2018-12-31 09:41:50,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (1/1) ... [2018-12-31 09:41:50,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (1/1) ... [2018-12-31 09:41:50,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (1/1) ... [2018-12-31 09:41:50,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (1/1) ... [2018-12-31 09:41:50,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:41:50,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:41:50,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:41:50,336 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:41:50,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:41:50,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:41:50,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:41:50,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:41:50,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:41:52,567 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:41:52,567 INFO L280 CfgBuilder]: Removed 278 assue(true) statements. [2018-12-31 09:41:52,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:52 BoogieIcfgContainer [2018-12-31 09:41:52,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:41:52,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:41:52,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:41:52,573 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:41:52,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:41:49" (1/3) ... [2018-12-31 09:41:52,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675af037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:41:52, skipping insertion in model container [2018-12-31 09:41:52,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:50" (2/3) ... [2018-12-31 09:41:52,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675af037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:41:52, skipping insertion in model container [2018-12-31 09:41:52,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:52" (3/3) ... [2018-12-31 09:41:52,577 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product54_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:52,588 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:41:52,604 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:41:52,623 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:41:52,659 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:41:52,659 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:41:52,659 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:41:52,660 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:41:52,660 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:41:52,660 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:41:52,660 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:41:52,661 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:41:52,661 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:41:52,683 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states. [2018-12-31 09:41:52,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:41:52,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:52,693 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:52,696 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:52,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:52,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1439730149, now seen corresponding path program 1 times [2018-12-31 09:41:52,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:52,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:52,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:52,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:52,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:52,968 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:52,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:52,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:52,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:41:52,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:41:52,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:41:52,990 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 2 states. [2018-12-31 09:41:53,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:53,046 INFO L93 Difference]: Finished difference Result 372 states and 569 transitions. [2018-12-31 09:41:53,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:41:53,048 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:41:53,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:53,067 INFO L225 Difference]: With dead ends: 372 [2018-12-31 09:41:53,068 INFO L226 Difference]: Without dead ends: 185 [2018-12-31 09:41:53,072 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:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-31 09:41:53,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-12-31 09:41:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-31 09:41:53,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 276 transitions. [2018-12-31 09:41:53,133 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 276 transitions. Word has length 16 [2018-12-31 09:41:53,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:53,134 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 276 transitions. [2018-12-31 09:41:53,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:41:53,134 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 276 transitions. [2018-12-31 09:41:53,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:41:53,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:53,136 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:53,136 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:53,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:53,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1808480250, now seen corresponding path program 1 times [2018-12-31 09:41:53,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:53,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:53,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:53,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:53,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:53,278 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:53,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:53,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:41:53,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:53,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:53,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:53,286 INFO L87 Difference]: Start difference. First operand 185 states and 276 transitions. Second operand 3 states. [2018-12-31 09:41:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:53,336 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2018-12-31 09:41:53,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:53,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:41:53,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:53,340 INFO L225 Difference]: With dead ends: 185 [2018-12-31 09:41:53,340 INFO L226 Difference]: Without dead ends: 71 [2018-12-31 09:41:53,342 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:53,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-31 09:41:53,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-31 09:41:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-31 09:41:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 105 transitions. [2018-12-31 09:41:53,362 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 105 transitions. Word has length 17 [2018-12-31 09:41:53,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:53,362 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 105 transitions. [2018-12-31 09:41:53,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:53,362 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 105 transitions. [2018-12-31 09:41:53,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:41:53,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:53,364 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:53,364 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:53,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:53,365 INFO L82 PathProgramCache]: Analyzing trace with hash -886510538, now seen corresponding path program 1 times [2018-12-31 09:41:53,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:53,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:53,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:53,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:53,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:53,593 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:53,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:53,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:41:53,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:53,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:53,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:53,595 INFO L87 Difference]: Start difference. First operand 71 states and 105 transitions. Second operand 5 states. [2018-12-31 09:41:53,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:53,757 INFO L93 Difference]: Finished difference Result 136 states and 204 transitions. [2018-12-31 09:41:53,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:41:53,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-31 09:41:53,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:53,760 INFO L225 Difference]: With dead ends: 136 [2018-12-31 09:41:53,763 INFO L226 Difference]: Without dead ends: 71 [2018-12-31 09:41:53,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:41:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-31 09:41:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-31 09:41:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-31 09:41:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 104 transitions. [2018-12-31 09:41:53,781 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 104 transitions. Word has length 22 [2018-12-31 09:41:53,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:53,782 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 104 transitions. [2018-12-31 09:41:53,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 104 transitions. [2018-12-31 09:41:53,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:41:53,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:53,786 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:53,786 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:53,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:53,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1823541737, now seen corresponding path program 1 times [2018-12-31 09:41:53,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:53,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:53,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:53,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:53,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:53,901 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:53,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:53,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:53,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:53,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:53,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:53,903 INFO L87 Difference]: Start difference. First operand 71 states and 104 transitions. Second operand 3 states. [2018-12-31 09:41:53,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:53,991 INFO L93 Difference]: Finished difference Result 145 states and 214 transitions. [2018-12-31 09:41:53,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:53,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-31 09:41:53,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:53,994 INFO L225 Difference]: With dead ends: 145 [2018-12-31 09:41:53,994 INFO L226 Difference]: Without dead ends: 80 [2018-12-31 09:41:53,995 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:53,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-31 09:41:54,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-12-31 09:41:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-31 09:41:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 110 transitions. [2018-12-31 09:41:54,010 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 110 transitions. Word has length 25 [2018-12-31 09:41:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:54,010 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 110 transitions. [2018-12-31 09:41:54,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 110 transitions. [2018-12-31 09:41:54,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:54,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:54,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:54,013 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:54,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:54,013 INFO L82 PathProgramCache]: Analyzing trace with hash -920121944, now seen corresponding path program 1 times [2018-12-31 09:41:54,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:54,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:54,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:54,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:54,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:54,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:54,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:41:54,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:54,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:54,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:54,157 INFO L87 Difference]: Start difference. First operand 78 states and 110 transitions. Second operand 5 states. [2018-12-31 09:41:54,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:54,383 INFO L93 Difference]: Finished difference Result 204 states and 285 transitions. [2018-12-31 09:41:54,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:41:54,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:41:54,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:54,385 INFO L225 Difference]: With dead ends: 204 [2018-12-31 09:41:54,386 INFO L226 Difference]: Without dead ends: 132 [2018-12-31 09:41:54,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:41:54,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-31 09:41:54,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 87. [2018-12-31 09:41:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-31 09:41:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2018-12-31 09:41:54,398 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 31 [2018-12-31 09:41:54,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:54,399 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2018-12-31 09:41:54,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:54,399 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2018-12-31 09:41:54,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:54,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:54,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:54,401 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:54,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:54,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1742389099, now seen corresponding path program 1 times [2018-12-31 09:41:54,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:54,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:54,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:54,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:54,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:54,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:54,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:54,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:54,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:54,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:54,739 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 5 states. [2018-12-31 09:41:55,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:55,835 INFO L93 Difference]: Finished difference Result 250 states and 344 transitions. [2018-12-31 09:41:55,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:41:55,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:41:55,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:55,838 INFO L225 Difference]: With dead ends: 250 [2018-12-31 09:41:55,838 INFO L226 Difference]: Without dead ends: 248 [2018-12-31 09:41:55,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:41:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-12-31 09:41:55,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 87. [2018-12-31 09:41:55,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-31 09:41:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2018-12-31 09:41:55,855 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 31 [2018-12-31 09:41:55,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:55,855 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2018-12-31 09:41:55,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:55,855 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2018-12-31 09:41:55,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:55,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:55,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:55,859 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:55,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:55,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1313148954, now seen corresponding path program 1 times [2018-12-31 09:41:55,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:55,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:55,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:55,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:55,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:56,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:56,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:56,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:41:56,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:41:56,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:41:56,040 INFO L87 Difference]: Start difference. First operand 87 states and 118 transitions. Second operand 4 states. [2018-12-31 09:41:56,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:56,187 INFO L93 Difference]: Finished difference Result 204 states and 276 transitions. [2018-12-31 09:41:56,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:41:56,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-12-31 09:41:56,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:56,190 INFO L225 Difference]: With dead ends: 204 [2018-12-31 09:41:56,191 INFO L226 Difference]: Without dead ends: 123 [2018-12-31 09:41:56,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-31 09:41:56,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 93. [2018-12-31 09:41:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-31 09:41:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2018-12-31 09:41:56,220 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 31 [2018-12-31 09:41:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:56,221 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-12-31 09:41:56,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:41:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2018-12-31 09:41:56,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:56,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:56,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:56,227 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:56,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:56,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1054983516, now seen corresponding path program 1 times [2018-12-31 09:41:56,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:56,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:56,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:56,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:56,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:56,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:56,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:56,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:56,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:56,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:56,311 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2018-12-31 09:41:56,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:56,510 INFO L93 Difference]: Finished difference Result 207 states and 277 transitions. [2018-12-31 09:41:56,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:56,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-31 09:41:56,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:56,512 INFO L225 Difference]: With dead ends: 207 [2018-12-31 09:41:56,512 INFO L226 Difference]: Without dead ends: 120 [2018-12-31 09:41:56,512 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:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-31 09:41:56,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-12-31 09:41:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-31 09:41:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 157 transitions. [2018-12-31 09:41:56,529 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 157 transitions. Word has length 31 [2018-12-31 09:41:56,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:56,529 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 157 transitions. [2018-12-31 09:41:56,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 157 transitions. [2018-12-31 09:41:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:41:56,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:56,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:56,531 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:56,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:56,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1127223910, now seen corresponding path program 1 times [2018-12-31 09:41:56,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:56,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:56,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:56,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:56,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:57,127 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-12-31 09:41:57,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:57,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:57,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:57,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:57,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:57,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:57,136 INFO L87 Difference]: Start difference. First operand 120 states and 157 transitions. Second operand 5 states. [2018-12-31 09:41:57,474 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-31 09:41:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:58,024 INFO L93 Difference]: Finished difference Result 615 states and 812 transitions. [2018-12-31 09:41:58,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:41:58,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-31 09:41:58,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:58,029 INFO L225 Difference]: With dead ends: 615 [2018-12-31 09:41:58,030 INFO L226 Difference]: Without dead ends: 501 [2018-12-31 09:41:58,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:41:58,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-12-31 09:41:58,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 226. [2018-12-31 09:41:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-31 09:41:58,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 294 transitions. [2018-12-31 09:41:58,070 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 294 transitions. Word has length 32 [2018-12-31 09:41:58,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:58,070 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 294 transitions. [2018-12-31 09:41:58,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:58,070 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 294 transitions. [2018-12-31 09:41:58,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 09:41:58,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:58,073 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:58,073 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:58,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:58,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1518924332, now seen corresponding path program 1 times [2018-12-31 09:41:58,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:58,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:58,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:58,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:58,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:41:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:41:58,532 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:41:58,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:41:58 BoogieIcfgContainer [2018-12-31 09:41:58,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:41:58,638 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:41:58,639 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:41:58,639 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:41:58,640 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:52" (3/4) ... [2018-12-31 09:41:58,643 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:41:58,783 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:41:58,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:41:58,784 INFO L168 Benchmark]: Toolchain (without parser) took 9367.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:58,784 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:41:58,785 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:58,786 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:58,786 INFO L168 Benchmark]: Boogie Preprocessor took 93.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:41:58,787 INFO L168 Benchmark]: RCFGBuilder took 2232.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.2 MB). Peak memory consumption was 85.2 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:58,787 INFO L168 Benchmark]: TraceAbstraction took 6068.87 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -86.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:41:58,788 INFO L168 Benchmark]: Witness Printer took 144.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:58,791 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 723.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.04 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 93.86 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 2232.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.2 MB). Peak memory consumption was 85.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6068.87 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -86.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 144.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 216]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L229] int pumpRunning = 0; [L230] int systemActive = 1; [L691] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L889] int waterLevel = 1; [L890] int methaneLevelCritical = 0; [L121] int retValue_acc ; [L122] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L487] int retValue_acc ; [L490] retValue_acc = 1 [L491] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L128] tmp = valid_product() [L130] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L146] int splverifierCounter ; [L147] int tmp ; [L148] int tmp___0 ; [L149] int tmp___1 ; [L150] int tmp___2 ; [L153] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L155] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L157] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L163] tmp = __VERIFIER_nondet_int() [L165] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L907] COND TRUE waterLevel < 2 [L908] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L173] tmp___0 = __VERIFIER_nondet_int() [L175] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L919] COND FALSE !(\read(methaneLevelCritical)) [L922] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L183] tmp___2 = __VERIFIER_nondet_int() [L185] COND TRUE \read(tmp___2) [L456] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L237] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L244] COND TRUE \read(systemActive) [L318] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L321] COND FALSE !(\read(pumpRunning)) [L292] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L295] COND FALSE !(\read(pumpRunning)) [L266] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L269] COND TRUE ! pumpRunning [L415] int retValue_acc ; [L416] int tmp ; [L417] int tmp___0 ; [L969] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L972] COND FALSE !(waterLevel < 2) [L976] retValue_acc = 0 [L977] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L421] tmp = isHighWaterSensorDry() [L423] COND FALSE !(\read(tmp)) [L426] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L428] retValue_acc = tmp___0 [L429] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L271] tmp = isHighWaterLevel() [L273] COND TRUE \read(tmp) [L346] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L497] int tmp ; [L498] int tmp___0 ; [L928] int retValue_acc ; [L931] retValue_acc = methaneLevelCritical [L932] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L502] tmp = isMethaneLevelCritical() [L504] COND TRUE \read(tmp) [L370] int retValue_acc ; [L373] retValue_acc = pumpRunning [L374] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L506] tmp___0 = isPumpRunning() [L508] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L216] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 189 locations, 3 error locations. UNSAFE Result, 5.9s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1137 SDtfs, 1314 SDslu, 1238 SDs, 0 SdLazy, 197 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 513 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 15647 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...