./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product34.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8d31f386 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/product-lines/minepump_spec4_product34.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5755897c1254f90f3058dc77caf92ead54b02784 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.multireach-323-8d31f38 [2021-07-06 20:29:35,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 20:29:35,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 20:29:35,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 20:29:35,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 20:29:35,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 20:29:35,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 20:29:35,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 20:29:35,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 20:29:35,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 20:29:35,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 20:29:35,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 20:29:35,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 20:29:35,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 20:29:35,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 20:29:35,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 20:29:35,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 20:29:35,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 20:29:35,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 20:29:35,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 20:29:35,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 20:29:35,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 20:29:35,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 20:29:35,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 20:29:35,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 20:29:35,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 20:29:35,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 20:29:35,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 20:29:35,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 20:29:35,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 20:29:35,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 20:29:35,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 20:29:35,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 20:29:35,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 20:29:35,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 20:29:35,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 20:29:35,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 20:29:35,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 20:29:35,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 20:29:35,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 20:29:35,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 20:29:35,139 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-07-06 20:29:35,177 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 20:29:35,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 20:29:35,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 20:29:35,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 20:29:35,179 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 20:29:35,179 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 20:29:35,179 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 20:29:35,180 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 20:29:35,180 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 20:29:35,180 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 20:29:35,181 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 20:29:35,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 20:29:35,181 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 20:29:35,181 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 20:29:35,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 20:29:35,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 20:29:35,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 20:29:35,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 20:29:35,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 20:29:35,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 20:29:35,182 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 20:29:35,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 20:29:35,182 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 20:29:35,183 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 20:29:35,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 20:29:35,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 20:29:35,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 20:29:35,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 20:29:35,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 20:29:35,183 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 20:29:35,184 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 20:29:35,184 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(F end) ) 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 -> 5755897c1254f90f3058dc77caf92ead54b02784 [2021-07-06 20:29:35,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 20:29:35,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 20:29:35,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 20:29:35,471 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 20:29:35,471 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 20:29:35,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product34.cil.c [2021-07-06 20:29:35,533 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa84a60a/5f99a466cb2148f797784f68c5a0139d/FLAG770e03587 [2021-07-06 20:29:35,953 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 20:29:35,954 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product34.cil.c [2021-07-06 20:29:35,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa84a60a/5f99a466cb2148f797784f68c5a0139d/FLAG770e03587 [2021-07-06 20:29:35,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa84a60a/5f99a466cb2148f797784f68c5a0139d [2021-07-06 20:29:35,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 20:29:35,981 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 20:29:35,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 20:29:35,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 20:29:35,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 20:29:35,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:29:35" (1/1) ... [2021-07-06 20:29:35,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ae6fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:29:35, skipping insertion in model container [2021-07-06 20:29:35,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:29:35" (1/1) ... [2021-07-06 20:29:36,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 20:29:36,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 20:29:36,181 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product34.cil.c[7702,7715] [2021-07-06 20:29:36,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:29:36,245 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 20:29:36,298 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product34.cil.c[7702,7715] [2021-07-06 20:29:36,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:29:36,347 INFO L208 MainTranslator]: Completed translation [2021-07-06 20:29:36,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:29:36 WrapperNode [2021-07-06 20:29:36,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 20:29:36,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 20:29:36,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 20:29:36,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 20:29:36,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:29:36" (1/1) ... [2021-07-06 20:29:36,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:29:36" (1/1) ... [2021-07-06 20:29:36,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 20:29:36,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 20:29:36,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 20:29:36,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 20:29:36,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:29:36" (1/1) ... [2021-07-06 20:29:36,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:29:36" (1/1) ... [2021-07-06 20:29:36,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:29:36" (1/1) ... [2021-07-06 20:29:36,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:29:36" (1/1) ... [2021-07-06 20:29:36,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:29:36" (1/1) ... [2021-07-06 20:29:36,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:29:36" (1/1) ... [2021-07-06 20:29:36,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:29:36" (1/1) ... [2021-07-06 20:29:36,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 20:29:36,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 20:29:36,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 20:29:36,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 20:29:36,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:29:36" (1/1) ... [2021-07-06 20:29:36,467 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 20:29:36,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 20:29:36,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-07-06 20:29:36,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-07-06 20:29:36,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 20:29:36,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 20:29:36,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 20:29:36,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 20:29:37,108 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 20:29:37,108 INFO L299 CfgBuilder]: Removed 98 assume(true) statements. [2021-07-06 20:29:37,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:29:37 BoogieIcfgContainer [2021-07-06 20:29:37,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 20:29:37,110 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 20:29:37,110 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 20:29:37,112 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 20:29:37,113 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:29:37,113 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 08:29:35" (1/3) ... [2021-07-06 20:29:37,114 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b144fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:29:37, skipping insertion in model container [2021-07-06 20:29:37,114 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:29:37,114 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:29:36" (2/3) ... [2021-07-06 20:29:37,115 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b144fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:29:37, skipping insertion in model container [2021-07-06 20:29:37,115 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:29:37,115 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:29:37" (3/3) ... [2021-07-06 20:29:37,116 INFO L389 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product34.cil.c [2021-07-06 20:29:37,143 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 20:29:37,143 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 20:29:37,143 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 20:29:37,143 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 20:29:37,143 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 20:29:37,143 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 20:29:37,144 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 20:29:37,144 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 20:29:37,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 75 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 74 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:29:37,171 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2021-07-06 20:29:37,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:29:37,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:29:37,176 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:29:37,177 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:29:37,177 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 20:29:37,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 75 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 74 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:29:37,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2021-07-06 20:29:37,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:29:37,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:29:37,181 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:29:37,181 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:29:37,184 INFO L791 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(13);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string37.base, #t~string37.offset, 1);call write~init~int(77, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(101, #t~string37.base, 2 + #t~string37.offset, 1);call write~init~int(116, #t~string37.base, 3 + #t~string37.offset, 1);call write~init~int(104, #t~string37.base, 4 + #t~string37.offset, 1);call write~init~int(58, #t~string37.base, 5 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 6 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string39.base, #t~string39.offset, 1);call write~init~int(82, #t~string39.base, 1 + #t~string39.offset, 1);call write~init~int(73, #t~string39.base, 2 + #t~string39.offset, 1);call write~init~int(84, #t~string39.base, 3 + #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 4 + #t~string39.offset, 1);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string41.base, #t~string41.offset, 1);call write~init~int(75, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 2 + #t~string41.offset, 1);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string43.base, #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 1 + #t~string43.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(30);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(9);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(21);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(30);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(9);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(25);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(30);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(9);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 12#L-1true havoc main_#res;havoc main_#t~ret9, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 3#L197true havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 42#L205true main_#t~ret9 := valid_product_#res;main_~tmp~1 := main_#t~ret9;havoc main_#t~ret9; 39#L161true assume 0 != main_~tmp~1; 63#L134true havoc test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, test_#t~nondet14, test_~splverifierCounter~0, test_~tmp~2, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~2;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 55#L53-1true [2021-07-06 20:29:37,185 INFO L793 eck$LassoCheckResult]: Loop: 55#L53-1true assume !false; 65#L222true assume test_~splverifierCounter~0 < 4; 33#L223true test_~tmp~2 := test_#t~nondet11;havoc test_#t~nondet11; 30#L231true assume !(0 != test_~tmp~2); 27#L231-1true test_~tmp___0~1 := test_#t~nondet12;havoc test_#t~nondet12; 8#L241true assume !(0 != test_~tmp___0~1); 5#L241-1true test_~tmp___2~0 := test_#t~nondet13;havoc test_#t~nondet13; 62#L251true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 14#L259-2true assume !(0 != ~pumpRunning~0); 75#L291true assume !(0 != ~systemActive~0); 67#L298true havoc __utac_acc__Specification4_spec__1_#t~ret7, __utac_acc__Specification4_spec__1_#t~ret8, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 15#L519true __utac_acc__Specification4_spec__1_#t~ret7 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret7;havoc __utac_acc__Specification4_spec__1_#t~ret7; 68#L53true assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 55#L53-1true [2021-07-06 20:29:37,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:29:37,189 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2021-07-06 20:29:37,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:29:37,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379729332] [2021-07-06 20:29:37,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:29:37,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:29:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:29:37,321 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:29:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:29:37,378 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:29:37,398 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:29:37,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:29:37,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1680575549, now seen corresponding path program 1 times [2021-07-06 20:29:37,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:29:37,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474272174] [2021-07-06 20:29:37,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:29:37,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:29:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:29:37,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:29:37,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:29:37,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:29:37,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:29:37,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:29:37,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:29:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 20:29:37,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:29:37,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474272174] [2021-07-06 20:29:37,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474272174] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:29:37,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:29:37,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:29:37,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838366031] [2021-07-06 20:29:37,438 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:29:37,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:29:37,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:29:37,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:29:37,449 INFO L87 Difference]: Start difference. First operand has 75 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 74 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:29:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:29:37,469 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2021-07-06 20:29:37,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:29:37,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 104 transitions. [2021-07-06 20:29:37,473 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2021-07-06 20:29:37,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 96 transitions. [2021-07-06 20:29:37,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2021-07-06 20:29:37,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-07-06 20:29:37,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2021-07-06 20:29:37,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:29:37,478 INFO L681 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-07-06 20:29:37,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2021-07-06 20:29:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-07-06 20:29:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.411764705882353) internal successors, (96), 67 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:29:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2021-07-06 20:29:37,495 INFO L704 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-07-06 20:29:37,495 INFO L587 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-07-06 20:29:37,495 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 20:29:37,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2021-07-06 20:29:37,497 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2021-07-06 20:29:37,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:29:37,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:29:37,497 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:29:37,497 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:29:37,498 INFO L791 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(13);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string37.base, #t~string37.offset, 1);call write~init~int(77, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(101, #t~string37.base, 2 + #t~string37.offset, 1);call write~init~int(116, #t~string37.base, 3 + #t~string37.offset, 1);call write~init~int(104, #t~string37.base, 4 + #t~string37.offset, 1);call write~init~int(58, #t~string37.base, 5 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 6 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string39.base, #t~string39.offset, 1);call write~init~int(82, #t~string39.base, 1 + #t~string39.offset, 1);call write~init~int(73, #t~string39.base, 2 + #t~string39.offset, 1);call write~init~int(84, #t~string39.base, 3 + #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 4 + #t~string39.offset, 1);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string41.base, #t~string41.offset, 1);call write~init~int(75, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 2 + #t~string41.offset, 1);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string43.base, #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 1 + #t~string43.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(30);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(9);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(21);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(30);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(9);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(25);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(30);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(9);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 177#L-1 havoc main_#res;havoc main_#t~ret9, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 159#L197 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 160#L205 main_#t~ret9 := valid_product_#res;main_~tmp~1 := main_#t~ret9;havoc main_#t~ret9; 209#L161 assume 0 != main_~tmp~1; 210#L134 havoc test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, test_#t~nondet14, test_~splverifierCounter~0, test_~tmp~2, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~2;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 223#L53-1 [2021-07-06 20:29:37,498 INFO L793 eck$LassoCheckResult]: Loop: 223#L53-1 assume !false; 224#L222 assume test_~splverifierCounter~0 < 4; 205#L223 test_~tmp~2 := test_#t~nondet11;havoc test_#t~nondet11; 201#L231 assume !(0 != test_~tmp~2); 200#L231-1 test_~tmp___0~1 := test_#t~nondet12;havoc test_#t~nondet12; 169#L241 assume !(0 != test_~tmp___0~1); 163#L241-1 test_~tmp___2~0 := test_#t~nondet13;havoc test_#t~nondet13; 164#L251 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 181#L259-2 assume !(0 != ~pumpRunning~0); 182#L291 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret15, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 216#L323 assume !(0 == ~pumpRunning~0); 217#L298 havoc __utac_acc__Specification4_spec__1_#t~ret7, __utac_acc__Specification4_spec__1_#t~ret8, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 184#L519 __utac_acc__Specification4_spec__1_#t~ret7 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret7;havoc __utac_acc__Specification4_spec__1_#t~ret7; 185#L53 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 223#L53-1 [2021-07-06 20:29:37,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:29:37,498 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2021-07-06 20:29:37,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:29:37,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242150509] [2021-07-06 20:29:37,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:29:37,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:29:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:29:37,525 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:29:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:29:37,551 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:29:37,561 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:29:37,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:29:37,561 INFO L82 PathProgramCache]: Analyzing trace with hash -589844997, now seen corresponding path program 1 times [2021-07-06 20:29:37,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:29:37,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144421289] [2021-07-06 20:29:37,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:29:37,562 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:29:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:29:37,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:29:37,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:29:37,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:29:37,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:29:37,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:29:37,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:29:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 20:29:37,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:29:37,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144421289] [2021-07-06 20:29:37,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144421289] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:29:37,573 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:29:37,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:29:37,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150886280] [2021-07-06 20:29:37,573 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:29:37,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:29:37,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:29:37,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:29:37,574 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 30 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:29:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:29:37,618 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2021-07-06 20:29:37,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:29:37,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 147 transitions. [2021-07-06 20:29:37,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 76 [2021-07-06 20:29:37,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 109 states and 147 transitions. [2021-07-06 20:29:37,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2021-07-06 20:29:37,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2021-07-06 20:29:37,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 147 transitions. [2021-07-06 20:29:37,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:29:37,637 INFO L681 BuchiCegarLoop]: Abstraction has 109 states and 147 transitions. [2021-07-06 20:29:37,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 147 transitions. [2021-07-06 20:29:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-07-06 20:29:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.348623853211009) internal successors, (147), 108 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:29:37,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2021-07-06 20:29:37,642 INFO L704 BuchiCegarLoop]: Abstraction has 109 states and 147 transitions. [2021-07-06 20:29:37,642 INFO L587 BuchiCegarLoop]: Abstraction has 109 states and 147 transitions. [2021-07-06 20:29:37,642 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 20:29:37,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 147 transitions. [2021-07-06 20:29:37,643 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 76 [2021-07-06 20:29:37,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:29:37,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:29:37,644 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:29:37,644 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:29:37,644 INFO L791 eck$LassoCheckResult]: Stem: 393#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(13);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string37.base, #t~string37.offset, 1);call write~init~int(77, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(101, #t~string37.base, 2 + #t~string37.offset, 1);call write~init~int(116, #t~string37.base, 3 + #t~string37.offset, 1);call write~init~int(104, #t~string37.base, 4 + #t~string37.offset, 1);call write~init~int(58, #t~string37.base, 5 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 6 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string39.base, #t~string39.offset, 1);call write~init~int(82, #t~string39.base, 1 + #t~string39.offset, 1);call write~init~int(73, #t~string39.base, 2 + #t~string39.offset, 1);call write~init~int(84, #t~string39.base, 3 + #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 4 + #t~string39.offset, 1);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string41.base, #t~string41.offset, 1);call write~init~int(75, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 2 + #t~string41.offset, 1);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string43.base, #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 1 + #t~string43.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(30);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(9);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(21);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(30);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(9);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(25);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(30);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(9);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 360#L-1 havoc main_#res;havoc main_#t~ret9, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 344#L197 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 345#L205 main_#t~ret9 := valid_product_#res;main_~tmp~1 := main_#t~ret9;havoc main_#t~ret9; 394#L161 assume 0 != main_~tmp~1; 395#L134 havoc test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, test_#t~nondet14, test_~splverifierCounter~0, test_~tmp~2, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~2;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 408#L53-1 [2021-07-06 20:29:37,644 INFO L793 eck$LassoCheckResult]: Loop: 408#L53-1 assume !false; 409#L222 assume test_~splverifierCounter~0 < 4; 390#L223 test_~tmp~2 := test_#t~nondet11;havoc test_#t~nondet11; 386#L231 assume !(0 != test_~tmp~2); 383#L231-1 test_~tmp___0~1 := test_#t~nondet12;havoc test_#t~nondet12; 352#L241 assume !(0 != test_~tmp___0~1); 346#L241-1 test_~tmp___2~0 := test_#t~nondet13;havoc test_#t~nondet13; 347#L251 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 363#L259-2 assume !(0 != ~pumpRunning~0); 364#L291 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret15, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 399#L323 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret33, isHighWaterLevel_~retValue_acc~5, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~2;havoc isHighWaterLevel_~retValue_acc~5;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~2;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~8;havoc isHighWaterSensorDry_~retValue_acc~8; 397#L527 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~8 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~8; 398#L532 isHighWaterLevel_#t~ret33 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret33;havoc isHighWaterLevel_#t~ret33; 391#L425 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~2 := 0; 392#L425-2 isHighWaterLevel_~retValue_acc~5 := isHighWaterLevel_~tmp___0~2;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~5; 374#L431 processEnvironment_#t~ret15 := isHighWaterLevel_#res;processEnvironment_~tmp~3 := processEnvironment_#t~ret15;havoc processEnvironment_#t~ret15; 375#L327 assume !(0 != processEnvironment_~tmp~3); 411#L298 havoc __utac_acc__Specification4_spec__1_#t~ret7, __utac_acc__Specification4_spec__1_#t~ret8, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 365#L519 __utac_acc__Specification4_spec__1_#t~ret7 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret7;havoc __utac_acc__Specification4_spec__1_#t~ret7; 366#L53 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 408#L53-1 [2021-07-06 20:29:37,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:29:37,645 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2021-07-06 20:29:37,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:29:37,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591304839] [2021-07-06 20:29:37,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:29:37,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:29:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:29:37,667 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:29:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:29:37,688 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:29:37,696 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:29:37,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:29:37,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1033973017, now seen corresponding path program 1 times [2021-07-06 20:29:37,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:29:37,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889422012] [2021-07-06 20:29:37,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:29:37,697 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:29:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:29:37,701 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:29:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:29:37,704 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:29:37,707 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:29:37,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:29:37,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1019261043, now seen corresponding path program 1 times [2021-07-06 20:29:37,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:29:37,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637496650] [2021-07-06 20:29:37,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:29:37,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:29:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:29:37,727 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:29:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:29:37,747 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:29:37,756 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:29:37,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:29:37,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-07-06 20:30:18,764 WARN L205 SmtUtils]: Spent 40.88 s on a formula simplification. DAG size of input: 491 DAG size of output: 433 [2021-07-06 20:30:18,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:30:18,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2127 [2021-07-06 20:30:39,758 WARN L205 SmtUtils]: Spent 20.86 s on a formula simplification that was a NOOP. DAG size: 433 [2021-07-06 20:30:39,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 08:30:39 BoogieIcfgContainer [2021-07-06 20:30:39,893 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 20:30:39,893 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 20:30:39,893 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 20:30:39,893 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 20:30:39,893 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:29:37" (3/4) ... [2021-07-06 20:30:39,895 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 20:30:39,969 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 20:30:39,969 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 20:30:39,970 INFO L168 Benchmark]: Toolchain (without parser) took 63989.02 ms. Allocated memory was 69.2 MB in the beginning and 117.4 MB in the end (delta: 48.2 MB). Free memory was 49.8 MB in the beginning and 67.1 MB in the end (delta: -17.3 MB). Peak memory consumption was 30.4 MB. Max. memory is 16.1 GB. [2021-07-06 20:30:39,970 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 69.2 MB. Free memory is still 49.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 20:30:39,970 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.33 ms. Allocated memory is still 69.2 MB. Free memory was 49.6 MB in the beginning and 42.3 MB in the end (delta: 7.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-07-06 20:30:39,971 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.22 ms. Allocated memory is still 69.2 MB. Free memory was 42.3 MB in the beginning and 39.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:30:39,971 INFO L168 Benchmark]: Boogie Preprocessor took 47.98 ms. Allocated memory is still 69.2 MB. Free memory was 39.3 MB in the beginning and 37.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:30:39,972 INFO L168 Benchmark]: RCFGBuilder took 651.04 ms. Allocated memory was 69.2 MB in the beginning and 96.5 MB in the end (delta: 27.3 MB). Free memory was 37.2 MB in the beginning and 60.3 MB in the end (delta: -23.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. [2021-07-06 20:30:39,972 INFO L168 Benchmark]: BuchiAutomizer took 62782.53 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 59.7 MB in the beginning and 69.2 MB in the end (delta: -9.5 MB). Peak memory consumption was 60.0 MB. Max. memory is 16.1 GB. [2021-07-06 20:30:39,973 INFO L168 Benchmark]: Witness Printer took 76.11 ms. Allocated memory is still 117.4 MB. Free memory was 69.2 MB in the beginning and 67.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:30:39,975 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 69.2 MB. Free memory is still 49.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 359.33 ms. Allocated memory is still 69.2 MB. Free memory was 49.6 MB in the beginning and 42.3 MB in the end (delta: 7.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 59.22 ms. Allocated memory is still 69.2 MB. Free memory was 42.3 MB in the beginning and 39.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 47.98 ms. Allocated memory is still 69.2 MB. Free memory was 39.3 MB in the beginning and 37.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 651.04 ms. Allocated memory was 69.2 MB in the beginning and 96.5 MB in the end (delta: 27.3 MB). Free memory was 37.2 MB in the beginning and 60.3 MB in the end (delta: -23.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 62782.53 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 59.7 MB in the beginning and 69.2 MB in the end (delta: -9.5 MB). Peak memory consumption was 60.0 MB. Max. memory is 16.1 GB. * Witness Printer took 76.11 ms. Allocated memory is still 117.4 MB. Free memory was 69.2 MB in the beginning and 67.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 109 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 62.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 62.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 13.4ms AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 109 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 212 SDtfs, 178 SDslu, 48 SDs, 0 SdLazy, 24 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.5ms Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 221]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1738} State at position 1 is {NULL=0, NULL=0, NULL=0, NULL=0, retValue_acc=0, NULL=1738, NULL=1747, NULL=0, NULL=1749, NULL=0, NULL=1743, NULL=1760, methaneLevelCritical=0, NULL=1765, tmp___0=0, tmp=0, retValue_acc=0, NULL=0, NULL=1741, NULL=0, NULL=0, tmp___1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24935ac6=0, NULL=0, NULL=0, NULL=1762, tmp___0=0, NULL=1759, NULL=1757, cleanupTimeShifts=4, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6700d353=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@641ee95b=0, NULL=1766, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69ed0b6a=0, NULL=1756, head=0, pumpRunning=0, retValue_acc=1, \result=0, NULL=1746, NULL=1767, tmp=1, NULL=0, NULL=0, NULL=1754, \result=1, NULL=1758, tmp=1, NULL=1755, NULL=0, NULL=0, tmp=1, NULL=1750, NULL=0, NULL=0, NULL=1761, NULL=0, retValue_acc=1, retValue_acc=1, tmp___2=71, NULL=0, NULL=1753, tmp___0=0, NULL=1748, splverifierCounter=0, NULL=0, NULL=1751, NULL=1744, NULL=1752, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54c4ea81=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10ace03c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e035ab=71, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7080f636=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6dd55220=0, tmp=0, head=0, NULL=0, NULL=0, NULL=1742, NULL=0, NULL=0, NULL=1745, NULL=0, NULL=0, NULL=0, NULL=1763, NULL=1764, NULL=1768} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L71] int cleanupTimeShifts = 4; [L284] int pumpRunning = 0; [L285] int systemActive = 1; [L444] int waterLevel = 1; [L445] int methaneLevelCritical = 0; [L716] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L152] int retValue_acc ; [L153] int tmp ; [L201] int retValue_acc ; [L204] retValue_acc = 1 [L205] return (retValue_acc); [L159] tmp = valid_product() [L161] COND TRUE \read(tmp) [L212] int splverifierCounter ; [L213] int tmp ; [L214] int tmp___0 ; [L215] int tmp___1 ; [L216] int tmp___2 ; [L219] splverifierCounter = 0 Loop: [L221] COND TRUE 1 [L223] COND TRUE splverifierCounter < 4 [L229] tmp = __VERIFIER_nondet_int() [L231] COND FALSE !(\read(tmp)) [L239] tmp___0 = __VERIFIER_nondet_int() [L241] COND FALSE !(\read(tmp___0)) [L249] tmp___2 = __VERIFIER_nondet_int() [L251] COND TRUE \read(tmp___2) [L439] systemActive = 1 [L291] COND FALSE !(\read(pumpRunning)) [L298] COND TRUE \read(systemActive) [L320] int tmp ; [L323] COND TRUE ! pumpRunning [L417] int retValue_acc ; [L418] int tmp ; [L419] int tmp___0 ; [L524] int retValue_acc ; [L527] COND TRUE waterLevel < 2 [L528] retValue_acc = 1 [L529] return (retValue_acc); [L423] tmp = isHighWaterSensorDry() [L425] COND TRUE \read(tmp) [L426] tmp___0 = 0 [L430] retValue_acc = tmp___0 [L431] return (retValue_acc); [L325] tmp = isHighWaterLevel() [L327] COND FALSE !(\read(tmp)) [L46] int tmp ; [L47] int tmp___0 ; [L515] int retValue_acc ; [L518] retValue_acc = waterLevel [L519] return (retValue_acc); [L51] tmp = getWaterLevel() [L53] COND FALSE !(tmp == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 20:30:40,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...