./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product38_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec1_product38_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 a0c13a298b8ef5fea6639223509104e0f4da0801 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:45:59,009 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:45:59,011 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:45:59,025 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:45:59,025 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:45:59,026 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:45:59,027 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:45:59,029 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:45:59,031 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:45:59,031 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:45:59,032 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:45:59,033 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:45:59,033 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:45:59,034 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:45:59,035 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:45:59,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:45:59,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:45:59,040 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:45:59,042 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:45:59,045 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:45:59,051 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:45:59,052 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:45:59,057 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:45:59,057 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:45:59,057 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:45:59,059 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:45:59,060 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:45:59,061 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:45:59,062 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:45:59,066 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:45:59,066 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:45:59,069 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:45:59,071 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:45:59,071 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:45:59,072 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:45:59,073 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:45:59,073 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:45:59,099 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:45:59,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:45:59,100 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:45:59,100 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:45:59,101 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:45:59,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:45:59,101 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:45:59,101 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:45:59,101 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:45:59,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:45:59,103 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:45:59,103 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:45:59,103 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:45:59,103 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:45:59,104 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:45:59,104 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:45:59,104 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:45:59,104 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:45:59,104 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:45:59,104 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:45:59,106 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:45:59,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:45:59,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:45:59,106 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:45:59,106 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:45:59,107 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:45:59,107 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:45:59,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:45:59,107 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 -> a0c13a298b8ef5fea6639223509104e0f4da0801 [2019-01-12 14:45:59,156 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:45:59,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:45:59,175 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:45:59,176 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:45:59,177 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:45:59,177 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product38_false-unreach-call_false-termination.cil.c [2019-01-12 14:45:59,247 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d66739823/7ed40b4fa129439ba85dba7339ac2a13/FLAGd72ac20e0 [2019-01-12 14:45:59,706 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:45:59,707 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product38_false-unreach-call_false-termination.cil.c [2019-01-12 14:45:59,719 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d66739823/7ed40b4fa129439ba85dba7339ac2a13/FLAGd72ac20e0 [2019-01-12 14:46:00,007 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d66739823/7ed40b4fa129439ba85dba7339ac2a13 [2019-01-12 14:46:00,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:46:00,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:46:00,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:46:00,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:46:00,018 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:46:00,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:46:00" (1/1) ... [2019-01-12 14:46:00,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b370eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:00, skipping insertion in model container [2019-01-12 14:46:00,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:46:00" (1/1) ... [2019-01-12 14:46:00,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:46:00,089 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:46:00,486 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:46:00,504 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:46:00,595 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:46:00,707 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:46:00,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:00 WrapperNode [2019-01-12 14:46:00,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:46:00,709 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:46:00,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:46:00,710 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:46:00,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:00" (1/1) ... [2019-01-12 14:46:00,738 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:00" (1/1) ... [2019-01-12 14:46:00,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:46:00,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:46:00,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:46:00,788 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:46:00,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:00" (1/1) ... [2019-01-12 14:46:00,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:00" (1/1) ... [2019-01-12 14:46:00,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:00" (1/1) ... [2019-01-12 14:46:00,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:00" (1/1) ... [2019-01-12 14:46:00,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:00" (1/1) ... [2019-01-12 14:46:00,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:00" (1/1) ... [2019-01-12 14:46:00,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:00" (1/1) ... [2019-01-12 14:46:00,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:46:00,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:46:00,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:46:00,836 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:46:00,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:46:00,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:46:00,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:46:00,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:46:00,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:46:02,377 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:46:02,377 INFO L286 CfgBuilder]: Removed 158 assue(true) statements. [2019-01-12 14:46:02,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:02 BoogieIcfgContainer [2019-01-12 14:46:02,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:46:02,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:46:02,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:46:02,384 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:46:02,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:46:00" (1/3) ... [2019-01-12 14:46:02,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d708880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:46:02, skipping insertion in model container [2019-01-12 14:46:02,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:00" (2/3) ... [2019-01-12 14:46:02,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d708880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:46:02, skipping insertion in model container [2019-01-12 14:46:02,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:02" (3/3) ... [2019-01-12 14:46:02,388 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product38_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:02,397 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:46:02,404 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:46:02,417 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:46:02,448 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:46:02,449 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:46:02,449 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:46:02,449 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:46:02,450 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:46:02,450 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:46:02,450 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:46:02,450 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:46:02,450 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:46:02,469 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-01-12 14:46:02,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:46:02,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:02,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:02,480 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:02,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:02,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1529342393, now seen corresponding path program 1 times [2019-01-12 14:46:02,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:02,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:02,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:02,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:02,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:02,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:02,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:02,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:46:02,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:46:02,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:46:02,802 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 2 states. [2019-01-12 14:46:02,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:02,832 INFO L93 Difference]: Finished difference Result 216 states and 329 transitions. [2019-01-12 14:46:02,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:46:02,833 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:46:02,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:02,844 INFO L225 Difference]: With dead ends: 216 [2019-01-12 14:46:02,845 INFO L226 Difference]: Without dead ends: 107 [2019-01-12 14:46:02,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:46:02,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-12 14:46:02,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-12 14:46:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-12 14:46:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2019-01-12 14:46:02,891 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 16 [2019-01-12 14:46:02,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:02,892 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2019-01-12 14:46:02,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:46:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2019-01-12 14:46:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:46:02,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:02,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:02,894 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:02,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:02,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1945506518, now seen corresponding path program 1 times [2019-01-12 14:46:02,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:02,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:02,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:03,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:03,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:03,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:46:03,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:03,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:03,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:03,047 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand 3 states. [2019-01-12 14:46:03,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:03,078 INFO L93 Difference]: Finished difference Result 107 states and 156 transitions. [2019-01-12 14:46:03,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:03,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:46:03,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:03,080 INFO L225 Difference]: With dead ends: 107 [2019-01-12 14:46:03,080 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 14:46:03,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:03,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 14:46:03,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-12 14:46:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 14:46:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2019-01-12 14:46:03,088 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 17 [2019-01-12 14:46:03,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:03,088 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2019-01-12 14:46:03,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2019-01-12 14:46:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:46:03,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:03,090 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:03,090 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:03,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:03,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1939738244, now seen corresponding path program 1 times [2019-01-12 14:46:03,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:03,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:03,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:03,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:03,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:03,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:03,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:46:03,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:03,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:03,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:03,289 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand 5 states. [2019-01-12 14:46:03,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:03,469 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2019-01-12 14:46:03,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:46:03,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-12 14:46:03,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:03,471 INFO L225 Difference]: With dead ends: 84 [2019-01-12 14:46:03,471 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 14:46:03,472 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 [2019-01-12 14:46:03,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 14:46:03,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-12 14:46:03,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 14:46:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2019-01-12 14:46:03,484 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 22 [2019-01-12 14:46:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:03,484 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2019-01-12 14:46:03,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2019-01-12 14:46:03,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:46:03,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:03,488 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] [2019-01-12 14:46:03,489 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:03,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:03,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1547834963, now seen corresponding path program 1 times [2019-01-12 14:46:03,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:03,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:03,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:03,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:03,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:03,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:03,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:03,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:03,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:03,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:03,662 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand 3 states. [2019-01-12 14:46:03,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:03,808 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2019-01-12 14:46:03,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:03,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-12 14:46:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:03,811 INFO L225 Difference]: With dead ends: 105 [2019-01-12 14:46:03,811 INFO L226 Difference]: Without dead ends: 66 [2019-01-12 14:46:03,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:03,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-12 14:46:03,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-01-12 14:46:03,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-12 14:46:03,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2019-01-12 14:46:03,822 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 24 [2019-01-12 14:46:03,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:03,823 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2019-01-12 14:46:03,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:03,823 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2019-01-12 14:46:03,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:46:03,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:03,825 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] [2019-01-12 14:46:03,826 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:03,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:03,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1827782978, now seen corresponding path program 1 times [2019-01-12 14:46:03,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:03,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:03,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:03,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:03,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:03,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:03,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:03,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:46:03,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:03,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:03,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:03,971 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand 5 states. [2019-01-12 14:46:04,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:04,105 INFO L93 Difference]: Finished difference Result 171 states and 239 transitions. [2019-01-12 14:46:04,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:46:04,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-12 14:46:04,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:04,108 INFO L225 Difference]: With dead ends: 171 [2019-01-12 14:46:04,108 INFO L226 Difference]: Without dead ends: 113 [2019-01-12 14:46:04,109 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 [2019-01-12 14:46:04,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-12 14:46:04,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 70. [2019-01-12 14:46:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-12 14:46:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2019-01-12 14:46:04,122 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 30 [2019-01-12 14:46:04,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:04,122 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2019-01-12 14:46:04,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2019-01-12 14:46:04,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:46:04,126 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:04,126 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] [2019-01-12 14:46:04,126 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:04,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:04,127 INFO L82 PathProgramCache]: Analyzing trace with hash 834728065, now seen corresponding path program 1 times [2019-01-12 14:46:04,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:04,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:04,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:04,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:04,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:04,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:04,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:04,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:04,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:04,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:04,344 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 5 states. [2019-01-12 14:46:04,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:04,867 INFO L93 Difference]: Finished difference Result 344 states and 483 transitions. [2019-01-12 14:46:04,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:46:04,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-12 14:46:04,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:04,870 INFO L225 Difference]: With dead ends: 344 [2019-01-12 14:46:04,871 INFO L226 Difference]: Without dead ends: 280 [2019-01-12 14:46:04,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:46:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-01-12 14:46:04,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 128. [2019-01-12 14:46:04,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-12 14:46:04,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 175 transitions. [2019-01-12 14:46:04,900 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 175 transitions. Word has length 30 [2019-01-12 14:46:04,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:04,900 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 175 transitions. [2019-01-12 14:46:04,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:04,900 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 175 transitions. [2019-01-12 14:46:04,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:46:04,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:04,902 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] [2019-01-12 14:46:04,902 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:04,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:04,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1506496567, now seen corresponding path program 1 times [2019-01-12 14:46:04,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:04,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:04,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:04,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:04,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:05,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:05,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:05,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:05,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:05,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:05,223 INFO L87 Difference]: Start difference. First operand 128 states and 175 transitions. Second operand 5 states. [2019-01-12 14:46:06,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:06,087 INFO L93 Difference]: Finished difference Result 366 states and 502 transitions. [2019-01-12 14:46:06,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:46:06,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:46:06,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:06,092 INFO L225 Difference]: With dead ends: 366 [2019-01-12 14:46:06,093 INFO L226 Difference]: Without dead ends: 364 [2019-01-12 14:46:06,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:46:06,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-01-12 14:46:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 128. [2019-01-12 14:46:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-12 14:46:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 174 transitions. [2019-01-12 14:46:06,120 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 174 transitions. Word has length 31 [2019-01-12 14:46:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:06,121 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 174 transitions. [2019-01-12 14:46:06,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:06,121 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 174 transitions. [2019-01-12 14:46:06,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:46:06,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:06,122 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] [2019-01-12 14:46:06,123 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:06,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:06,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1549041486, now seen corresponding path program 1 times [2019-01-12 14:46:06,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:06,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:06,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:06,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:06,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:06,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:06,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:06,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:46:06,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:46:06,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:46:06,217 INFO L87 Difference]: Start difference. First operand 128 states and 174 transitions. Second operand 4 states. [2019-01-12 14:46:06,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:06,574 INFO L93 Difference]: Finished difference Result 308 states and 416 transitions. [2019-01-12 14:46:06,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:46:06,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-01-12 14:46:06,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:06,576 INFO L225 Difference]: With dead ends: 308 [2019-01-12 14:46:06,576 INFO L226 Difference]: Without dead ends: 186 [2019-01-12 14:46:06,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:06,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-01-12 14:46:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 136. [2019-01-12 14:46:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-12 14:46:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 182 transitions. [2019-01-12 14:46:06,613 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 182 transitions. Word has length 31 [2019-01-12 14:46:06,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:06,613 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 182 transitions. [2019-01-12 14:46:06,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:46:06,613 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 182 transitions. [2019-01-12 14:46:06,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:46:06,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:06,619 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] [2019-01-12 14:46:06,619 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:06,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:06,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1290876048, now seen corresponding path program 1 times [2019-01-12 14:46:06,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:06,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:06,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:06,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:06,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:06,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:06,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:06,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:06,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:06,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:06,718 INFO L87 Difference]: Start difference. First operand 136 states and 182 transitions. Second operand 3 states. [2019-01-12 14:46:06,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:06,894 INFO L93 Difference]: Finished difference Result 316 states and 422 transitions. [2019-01-12 14:46:06,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:06,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-01-12 14:46:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:06,896 INFO L225 Difference]: With dead ends: 316 [2019-01-12 14:46:06,896 INFO L226 Difference]: Without dead ends: 186 [2019-01-12 14:46:06,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:06,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-01-12 14:46:06,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-01-12 14:46:06,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-12 14:46:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2019-01-12 14:46:06,941 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 31 [2019-01-12 14:46:06,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:06,944 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2019-01-12 14:46:06,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:06,945 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2019-01-12 14:46:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:46:06,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:06,953 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] [2019-01-12 14:46:06,953 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:06,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:06,954 INFO L82 PathProgramCache]: Analyzing trace with hash 891331378, now seen corresponding path program 1 times [2019-01-12 14:46:06,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:06,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:06,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:06,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:06,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:46:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:46:07,752 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:46:07,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:46:07 BoogieIcfgContainer [2019-01-12 14:46:07,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:46:07,933 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:46:07,933 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:46:07,933 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:46:07,934 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:02" (3/4) ... [2019-01-12 14:46:07,938 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:46:08,079 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:46:08,080 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:46:08,081 INFO L168 Benchmark]: Toolchain (without parser) took 8069.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 193.5 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -102.4 MB). Peak memory consumption was 91.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:08,083 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. [2019-01-12 14:46:08,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 694.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -151.2 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:08,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:08,086 INFO L168 Benchmark]: Boogie Preprocessor took 47.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:46:08,086 INFO L168 Benchmark]: RCFGBuilder took 1544.20 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: 66.8 MB). Peak memory consumption was 66.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:08,087 INFO L168 Benchmark]: TraceAbstraction took 5552.34 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -41.0 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:08,087 INFO L168 Benchmark]: Witness Printer took 147.19 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: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:08,099 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 694.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -151.2 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1544.20 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: 66.8 MB). Peak memory consumption was 66.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5552.34 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -41.0 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. * Witness Printer took 147.19 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: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 837]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L377] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L580] int pumpRunning = 0; [L581] int systemActive = 1; [L843] int waterLevel = 1; [L844] int methaneLevelCritical = 0; [L121] int retValue_acc ; [L122] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L170] int retValue_acc ; [L173] retValue_acc = 1 [L174] 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] [L767] int splverifierCounter ; [L768] int tmp ; [L769] int tmp___0 ; [L770] int tmp___1 ; [L771] int tmp___2 ; [L774] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L776] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L778] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L784] tmp = __VERIFIER_nondet_int() [L786] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L861] COND TRUE waterLevel < 2 [L862] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L794] tmp___0 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L873] COND FALSE !(\read(methaneLevelCritical)) [L876] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L804] tmp___2 = __VERIFIER_nondet_int() [L806] COND TRUE \read(tmp___2) [L761] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L587] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L594] COND TRUE \read(systemActive) [L642] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L645] COND FALSE !(\read(pumpRunning)) [L616] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L619] COND TRUE ! pumpRunning [L739] int retValue_acc ; [L740] int tmp ; [L741] int tmp___0 ; [L923] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L926] COND FALSE !(waterLevel < 2) [L930] retValue_acc = 0 [L931] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L745] tmp = isHighWaterSensorDry() [L747] COND FALSE !(\read(tmp)) [L750] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L752] retValue_acc = tmp___0 [L753] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L621] tmp = isHighWaterLevel() [L623] COND TRUE \read(tmp) [L670] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L183] int tmp ; [L184] int tmp___0 ; [L882] int retValue_acc ; [L885] retValue_acc = methaneLevelCritical [L886] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L188] tmp = isMethaneLevelCritical() [L190] COND TRUE \read(tmp) [L694] int retValue_acc ; [L697] retValue_acc = pumpRunning [L698] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L192] tmp___0 = isPumpRunning() [L194] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L837] __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, 111 locations, 3 error locations. UNSAFE Result, 5.4s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 785 SDtfs, 952 SDslu, 964 SDs, 0 SdLazy, 149 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 483 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 11571 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...