./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product56_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_product56_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 3236d89cedc127e9d85364eeaf0ba1493a1eae64 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:54,036 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:41:54,038 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:41:54,054 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:41:54,055 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:41:54,057 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:41:54,060 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:41:54,063 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:41:54,066 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:41:54,067 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:41:54,070 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:41:54,071 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:41:54,074 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:41:54,076 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:41:54,079 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:41:54,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:41:54,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:41:54,092 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:41:54,096 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:41:54,099 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:41:54,100 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:41:54,103 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:41:54,109 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:41:54,109 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:41:54,110 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:41:54,111 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:41:54,112 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:41:54,112 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:41:54,114 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:41:54,115 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:41:54,115 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:41:54,118 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:41:54,119 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:41:54,121 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:41:54,122 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:41:54,123 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:41:54,123 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:54,138 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:41:54,138 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:41:54,139 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:41:54,140 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:41:54,140 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:41:54,140 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:41:54,140 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:41:54,140 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:41:54,140 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:41:54,141 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:41:54,141 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:41:54,141 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:41:54,141 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:41:54,141 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:41:54,141 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:41:54,142 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:41:54,142 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:41:54,142 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:41:54,142 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:41:54,142 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:41:54,142 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:41:54,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:41:54,143 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:41:54,143 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:41:54,143 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:41:54,143 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:41:54,143 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:41:54,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:41:54,144 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 -> 3236d89cedc127e9d85364eeaf0ba1493a1eae64 [2018-12-31 09:41:54,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:41:54,195 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:41:54,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:41:54,205 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:41:54,205 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:41:54,206 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product56_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:54,271 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2672f4c3c/831ed1f249d34c05a66cb9a6ed392bb7/FLAG24bf3b36b [2018-12-31 09:41:54,796 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:41:54,798 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product56_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:54,811 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2672f4c3c/831ed1f249d34c05a66cb9a6ed392bb7/FLAG24bf3b36b [2018-12-31 09:41:55,090 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2672f4c3c/831ed1f249d34c05a66cb9a6ed392bb7 [2018-12-31 09:41:55,094 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:41:55,096 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:41:55,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:41:55,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:41:55,102 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:41:55,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:41:55" (1/1) ... [2018-12-31 09:41:55,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d0e1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:55, skipping insertion in model container [2018-12-31 09:41:55,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:41:55" (1/1) ... [2018-12-31 09:41:55,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:41:55,174 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:41:55,592 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:41:55,610 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:41:55,727 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:41:55,847 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:41:55,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:55 WrapperNode [2018-12-31 09:41:55,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:41:55,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:41:55,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:41:55,849 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:41:55,859 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:55" (1/1) ... [2018-12-31 09:41:55,879 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:55" (1/1) ... [2018-12-31 09:41:55,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:41:55,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:41:55,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:41:55,958 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:41:55,970 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:55" (1/1) ... [2018-12-31 09:41:55,971 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:55" (1/1) ... [2018-12-31 09:41:55,983 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:55" (1/1) ... [2018-12-31 09:41:55,984 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:55" (1/1) ... [2018-12-31 09:41:56,017 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:55" (1/1) ... [2018-12-31 09:41:56,042 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:55" (1/1) ... [2018-12-31 09:41:56,045 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:55" (1/1) ... [2018-12-31 09:41:56,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:41:56,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:41:56,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:41:56,063 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:41:56,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:55" (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:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:41:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:41:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:41:56,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:41:58,046 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:41:58,046 INFO L280 CfgBuilder]: Removed 282 assue(true) statements. [2018-12-31 09:41:58,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:58 BoogieIcfgContainer [2018-12-31 09:41:58,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:41:58,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:41:58,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:41:58,053 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:41:58,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:41:55" (1/3) ... [2018-12-31 09:41:58,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c37a2fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:41:58, skipping insertion in model container [2018-12-31 09:41:58,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:55" (2/3) ... [2018-12-31 09:41:58,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c37a2fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:41:58, skipping insertion in model container [2018-12-31 09:41:58,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:58" (3/3) ... [2018-12-31 09:41:58,057 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product56_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:58,068 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:41:58,077 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:41:58,095 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:41:58,126 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:41:58,127 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:41:58,127 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:41:58,127 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:41:58,128 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:41:58,128 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:41:58,128 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:41:58,128 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:41:58,128 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:41:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states. [2018-12-31 09:41:58,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:41:58,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:58,163 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:58,165 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:58,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1937289636, now seen corresponding path program 1 times [2018-12-31 09:41:58,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:58,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:58,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:58,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:58,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:58,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:58,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:58,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:41:58,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:41:58,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:41:58,472 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 2 states. [2018-12-31 09:41:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:58,550 INFO L93 Difference]: Finished difference Result 376 states and 575 transitions. [2018-12-31 09:41:58,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:41:58,552 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:41:58,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:58,582 INFO L225 Difference]: With dead ends: 376 [2018-12-31 09:41:58,583 INFO L226 Difference]: Without dead ends: 187 [2018-12-31 09:41:58,589 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:58,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-31 09:41:58,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-12-31 09:41:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-31 09:41:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 279 transitions. [2018-12-31 09:41:58,681 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 279 transitions. Word has length 16 [2018-12-31 09:41:58,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:58,681 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 279 transitions. [2018-12-31 09:41:58,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:41:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 279 transitions. [2018-12-31 09:41:58,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:41:58,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:58,683 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:58,683 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:58,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:58,684 INFO L82 PathProgramCache]: Analyzing trace with hash 890532739, now seen corresponding path program 1 times [2018-12-31 09:41:58,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:58,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:58,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:58,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:58,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:58,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:58,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:41:58,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:58,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:58,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:58,922 INFO L87 Difference]: Start difference. First operand 187 states and 279 transitions. Second operand 3 states. [2018-12-31 09:41:58,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:58,952 INFO L93 Difference]: Finished difference Result 187 states and 279 transitions. [2018-12-31 09:41:58,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:58,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:41:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:58,955 INFO L225 Difference]: With dead ends: 187 [2018-12-31 09:41:58,955 INFO L226 Difference]: Without dead ends: 73 [2018-12-31 09:41:58,957 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:58,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-31 09:41:58,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-31 09:41:58,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-31 09:41:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2018-12-31 09:41:58,965 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 17 [2018-12-31 09:41:58,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:58,965 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2018-12-31 09:41:58,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2018-12-31 09:41:58,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:41:58,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:58,967 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:58,967 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:58,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:58,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1577730230, now seen corresponding path program 1 times [2018-12-31 09:41:58,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:58,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:58,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:58,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:58,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:59,109 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:59,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:59,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:41:59,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:59,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:59,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:59,111 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 3 states. [2018-12-31 09:41:59,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:59,195 INFO L93 Difference]: Finished difference Result 207 states and 312 transitions. [2018-12-31 09:41:59,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:59,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-31 09:41:59,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:59,201 INFO L225 Difference]: With dead ends: 207 [2018-12-31 09:41:59,202 INFO L226 Difference]: Without dead ends: 140 [2018-12-31 09:41:59,203 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:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-31 09:41:59,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2018-12-31 09:41:59,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-31 09:41:59,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 205 transitions. [2018-12-31 09:41:59,223 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 205 transitions. Word has length 22 [2018-12-31 09:41:59,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:59,224 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 205 transitions. [2018-12-31 09:41:59,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:59,225 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 205 transitions. [2018-12-31 09:41:59,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:41:59,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:59,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] [2018-12-31 09:41:59,227 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:59,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:59,228 INFO L82 PathProgramCache]: Analyzing trace with hash 792163456, now seen corresponding path program 1 times [2018-12-31 09:41:59,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:59,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:59,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:59,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:59,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:59,332 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:59,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:59,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:59,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:59,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:59,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:59,334 INFO L87 Difference]: Start difference. First operand 136 states and 205 transitions. Second operand 3 states. [2018-12-31 09:41:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:59,558 INFO L93 Difference]: Finished difference Result 283 states and 430 transitions. [2018-12-31 09:41:59,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:59,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-31 09:41:59,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:59,561 INFO L225 Difference]: With dead ends: 283 [2018-12-31 09:41:59,561 INFO L226 Difference]: Without dead ends: 153 [2018-12-31 09:41:59,563 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:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-31 09:41:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-12-31 09:41:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-31 09:41:59,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2018-12-31 09:41:59,589 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 25 [2018-12-31 09:41:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:59,589 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2018-12-31 09:41:59,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:59,589 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2018-12-31 09:41:59,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:41:59,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:59,591 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:59,591 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:59,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:59,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1022954699, now seen corresponding path program 1 times [2018-12-31 09:41:59,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:59,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:59,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:59,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:59,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:59,707 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:59,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:59,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:59,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:59,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:59,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:59,708 INFO L87 Difference]: Start difference. First operand 151 states and 219 transitions. Second operand 5 states. [2018-12-31 09:41:59,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:59,977 INFO L93 Difference]: Finished difference Result 763 states and 1120 transitions. [2018-12-31 09:41:59,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:41:59,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-31 09:41:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:59,983 INFO L225 Difference]: With dead ends: 763 [2018-12-31 09:41:59,983 INFO L226 Difference]: Without dead ends: 618 [2018-12-31 09:41:59,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:41:59,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-12-31 09:42:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 286. [2018-12-31 09:42:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-31 09:42:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 411 transitions. [2018-12-31 09:42:00,042 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 411 transitions. Word has length 25 [2018-12-31 09:42:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:00,042 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 411 transitions. [2018-12-31 09:42:00,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 411 transitions. [2018-12-31 09:42:00,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 09:42:00,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:00,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:42:00,045 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:00,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:00,047 INFO L82 PathProgramCache]: Analyzing trace with hash 819147605, now seen corresponding path program 1 times [2018-12-31 09:42:00,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:00,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:00,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:00,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:00,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:00,192 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:42:00,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:00,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:42:00,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:00,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:00,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:00,194 INFO L87 Difference]: Start difference. First operand 286 states and 411 transitions. Second operand 5 states. [2018-12-31 09:42:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:01,387 INFO L93 Difference]: Finished difference Result 832 states and 1198 transitions. [2018-12-31 09:42:01,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:42:01,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-31 09:42:01,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:01,394 INFO L225 Difference]: With dead ends: 832 [2018-12-31 09:42:01,394 INFO L226 Difference]: Without dead ends: 830 [2018-12-31 09:42:01,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:42:01,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2018-12-31 09:42:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 286. [2018-12-31 09:42:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-31 09:42:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 409 transitions. [2018-12-31 09:42:01,434 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 409 transitions. Word has length 26 [2018-12-31 09:42:01,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:01,434 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 409 transitions. [2018-12-31 09:42:01,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 409 transitions. [2018-12-31 09:42:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:42:01,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:01,438 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:42:01,438 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:01,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:01,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1010263109, now seen corresponding path program 1 times [2018-12-31 09:42:01,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:01,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:01,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:01,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:01,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:01,676 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:42:01,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:01,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:42:01,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:01,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:01,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:01,678 INFO L87 Difference]: Start difference. First operand 286 states and 409 transitions. Second operand 5 states. [2018-12-31 09:42:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:02,104 INFO L93 Difference]: Finished difference Result 766 states and 1076 transitions. [2018-12-31 09:42:02,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:42:02,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-31 09:42:02,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:02,109 INFO L225 Difference]: With dead ends: 766 [2018-12-31 09:42:02,109 INFO L226 Difference]: Without dead ends: 486 [2018-12-31 09:42:02,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:42:02,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-12-31 09:42:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 322. [2018-12-31 09:42:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-12-31 09:42:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 445 transitions. [2018-12-31 09:42:02,150 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 445 transitions. Word has length 32 [2018-12-31 09:42:02,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:02,150 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 445 transitions. [2018-12-31 09:42:02,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 445 transitions. [2018-12-31 09:42:02,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:42:02,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:02,156 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:42:02,156 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:02,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:02,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1403290119, now seen corresponding path program 1 times [2018-12-31 09:42:02,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:02,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:02,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:02,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:02,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:02,251 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:42:02,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:02,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:42:02,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:02,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:02,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:02,253 INFO L87 Difference]: Start difference. First operand 322 states and 445 transitions. Second operand 5 states. [2018-12-31 09:42:03,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:03,130 INFO L93 Difference]: Finished difference Result 882 states and 1193 transitions. [2018-12-31 09:42:03,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:42:03,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-31 09:42:03,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:03,133 INFO L225 Difference]: With dead ends: 882 [2018-12-31 09:42:03,134 INFO L226 Difference]: Without dead ends: 566 [2018-12-31 09:42:03,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:42:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-12-31 09:42:03,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 346. [2018-12-31 09:42:03,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-12-31 09:42:03,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 469 transitions. [2018-12-31 09:42:03,173 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 469 transitions. Word has length 32 [2018-12-31 09:42:03,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:03,173 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 469 transitions. [2018-12-31 09:42:03,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:03,173 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 469 transitions. [2018-12-31 09:42:03,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:42:03,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:03,175 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:42:03,175 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:03,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:03,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1145124681, now seen corresponding path program 1 times [2018-12-31 09:42:03,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:03,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:03,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:03,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:03,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:03,261 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:42:03,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:03,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:03,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:03,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:03,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:03,262 INFO L87 Difference]: Start difference. First operand 346 states and 469 transitions. Second operand 3 states. [2018-12-31 09:42:03,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:03,501 INFO L93 Difference]: Finished difference Result 794 states and 1070 transitions. [2018-12-31 09:42:03,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:03,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-31 09:42:03,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:03,504 INFO L225 Difference]: With dead ends: 794 [2018-12-31 09:42:03,505 INFO L226 Difference]: Without dead ends: 454 [2018-12-31 09:42:03,506 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:42:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-12-31 09:42:03,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2018-12-31 09:42:03,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-12-31 09:42:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 599 transitions. [2018-12-31 09:42:03,558 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 599 transitions. Word has length 32 [2018-12-31 09:42:03,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:03,558 INFO L480 AbstractCegarLoop]: Abstraction has 454 states and 599 transitions. [2018-12-31 09:42:03,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:03,559 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 599 transitions. [2018-12-31 09:42:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 09:42:03,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:03,560 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:42:03,560 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:03,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:03,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2078796085, now seen corresponding path program 1 times [2018-12-31 09:42:03,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:03,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:03,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:03,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:03,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:42:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:42:04,232 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:42:04,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:42:04 BoogieIcfgContainer [2018-12-31 09:42:04,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:42:04,332 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:42:04,332 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:42:04,333 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:42:04,334 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:58" (3/4) ... [2018-12-31 09:42:04,337 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:42:04,468 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:42:04,469 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:42:04,470 INFO L168 Benchmark]: Toolchain (without parser) took 9375.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 954.0 MB in the beginning and 963.7 MB in the end (delta: -9.7 MB). Peak memory consumption was 202.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:04,473 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:42:04,473 INFO L168 Benchmark]: CACSL2BoogieTranslator took 751.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -171.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:04,473 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.03 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:04,475 INFO L168 Benchmark]: Boogie Preprocessor took 104.65 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:42:04,475 INFO L168 Benchmark]: RCFGBuilder took 1984.26 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: 79.7 MB). Peak memory consumption was 79.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:04,477 INFO L168 Benchmark]: TraceAbstraction took 6283.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.0 GB in the beginning and 971.8 MB in the end (delta: 60.2 MB). Peak memory consumption was 141.0 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:04,478 INFO L168 Benchmark]: Witness Printer took 137.24 ms. Allocated memory is still 1.2 GB. Free memory was 971.8 MB in the beginning and 963.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:04,488 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 751.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -171.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.03 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 104.65 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 1984.26 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: 79.7 MB). Peak memory consumption was 79.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6283.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.0 GB in the beginning and 971.8 MB in the end (delta: 60.2 MB). Peak memory consumption was 141.0 MB. Max. memory is 11.5 GB. * Witness Printer took 137.24 ms. Allocated memory is still 1.2 GB. Free memory was 971.8 MB in the beginning and 963.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 806]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L490] int pumpRunning = 0; [L491] int systemActive = 1; [L811] int cleanupTimeShifts = 4; [L908] int waterLevel = 1; [L909] int methaneLevelCritical = 0; [L884] int retValue_acc ; [L885] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L766] int retValue_acc ; [L769] retValue_acc = 1 [L770] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L891] tmp = valid_product() [L893] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L413] int splverifierCounter ; [L414] int tmp ; [L415] int tmp___0 ; [L416] int tmp___1 ; [L417] int tmp___2 ; [L420] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L422] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L424] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L430] tmp = __VERIFIER_nondet_int() [L432] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L926] COND TRUE waterLevel < 2 [L927] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L440] tmp___0 = __VERIFIER_nondet_int() [L442] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L938] COND FALSE !(\read(methaneLevelCritical)) [L941] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L450] tmp___2 = __VERIFIER_nondet_int() [L452] COND TRUE \read(tmp___2) [L732] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L498] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L505] COND TRUE \read(systemActive) [L579] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L582] COND FALSE !(\read(pumpRunning)) [L553] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L556] COND FALSE !(\read(pumpRunning)) [L527] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L530] COND TRUE ! pumpRunning [L676] int retValue_acc ; [L677] int tmp ; [L678] int tmp___0 ; [L988] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L991] COND FALSE !(waterLevel < 2) [L995] retValue_acc = 0 [L996] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L682] tmp = isHighWaterSensorDry() [L684] COND FALSE !(\read(tmp)) [L687] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L689] retValue_acc = tmp___0 [L690] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L532] tmp = isHighWaterLevel() [L534] COND TRUE \read(tmp) [L607] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L777] int tmp ; [L778] int tmp___0 ; [L947] int retValue_acc ; [L950] retValue_acc = methaneLevelCritical [L951] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L782] tmp = isMethaneLevelCritical() [L784] COND TRUE \read(tmp) [L631] int retValue_acc ; [L634] retValue_acc = pumpRunning [L635] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L786] tmp___0 = isPumpRunning() [L788] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L806] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 191 locations, 3 error locations. UNSAFE Result, 6.2s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1184 SDtfs, 1469 SDslu, 1535 SDs, 0 SdLazy, 215 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=454occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1266 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 10538 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...