./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product33.cil.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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_product33.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 5399744cbc243992ccbbf21bf0e09dd5dced55fce1050770392b2964c31c4145 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:17:48,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:17:48,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:17:48,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:17:48,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:17:48,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:17:48,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:17:48,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:17:48,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:17:48,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:17:48,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:17:48,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:17:48,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:17:48,973 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:17:48,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:17:48,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:17:48,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:17:48,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:17:48,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:17:48,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:17:48,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:17:48,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:17:48,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:17:48,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:17:48,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:17:48,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:17:48,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:17:48,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:17:48,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:17:48,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:17:48,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:17:48,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:17:48,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:17:48,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:17:48,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:17:48,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:17:48,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:17:48,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:17:48,999 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:17:49,000 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:17:49,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:17:49,001 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:17:49,022 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:17:49,022 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:17:49,023 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:17:49,023 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:17:49,024 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:17:49,024 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:17:49,024 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:17:49,024 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:17:49,024 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:17:49,024 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:17:49,025 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:17:49,025 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:17:49,025 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:17:49,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:17:49,026 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:17:49,026 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:17:49,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:17:49,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:17:49,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:17:49,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:17:49,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:17:49,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:17:49,027 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:17:49,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:17:49,027 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:17:49,027 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:17:49,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:17:49,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:17:49,028 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:17:49,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:17:49,028 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:17:49,029 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:17:49,030 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 -> 5399744cbc243992ccbbf21bf0e09dd5dced55fce1050770392b2964c31c4145 [2022-02-21 04:17:49,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:17:49,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:17:49,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:17:49,303 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:17:49,303 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:17:49,304 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product33.cil.c [2022-02-21 04:17:49,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a0d71f8/daeebf8d19c94923bb916a33760a9b0d/FLAG1bdfcadb9 [2022-02-21 04:17:49,805 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:17:49,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product33.cil.c [2022-02-21 04:17:49,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a0d71f8/daeebf8d19c94923bb916a33760a9b0d/FLAG1bdfcadb9 [2022-02-21 04:17:49,832 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a0d71f8/daeebf8d19c94923bb916a33760a9b0d [2022-02-21 04:17:49,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:17:49,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:17:49,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:17:49,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:17:49,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:17:49,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:17:49" (1/1) ... [2022-02-21 04:17:49,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e210d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:49, skipping insertion in model container [2022-02-21 04:17:49,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:17:49" (1/1) ... [2022-02-21 04:17:49,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:17:49,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:17:50,175 WARN L230 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_product33.cil.c[17260,17273] [2022-02-21 04:17:50,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:17:50,182 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:17:50,224 WARN L230 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_product33.cil.c[17260,17273] [2022-02-21 04:17:50,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:17:50,237 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:17:50,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:50 WrapperNode [2022-02-21 04:17:50,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:17:50,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:17:50,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:17:50,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:17:50,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:50" (1/1) ... [2022-02-21 04:17:50,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:50" (1/1) ... [2022-02-21 04:17:50,293 INFO L137 Inliner]: procedures = 52, calls = 149, calls flagged for inlining = 46, calls inlined = 47, statements flattened = 389 [2022-02-21 04:17:50,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:17:50,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:17:50,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:17:50,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:17:50,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:50" (1/1) ... [2022-02-21 04:17:50,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:50" (1/1) ... [2022-02-21 04:17:50,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:50" (1/1) ... [2022-02-21 04:17:50,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:50" (1/1) ... [2022-02-21 04:17:50,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:50" (1/1) ... [2022-02-21 04:17:50,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:50" (1/1) ... [2022-02-21 04:17:50,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:50" (1/1) ... [2022-02-21 04:17:50,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:17:50,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:17:50,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:17:50,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:17:50,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:50" (1/1) ... [2022-02-21 04:17:50,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:17:50,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:17:50,396 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) [2022-02-21 04:17:50,405 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 [2022-02-21 04:17:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:17:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:17:50,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:17:50,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:17:50,518 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:17:50,520 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:17:50,838 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:17:50,843 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:17:50,844 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 04:17:50,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:17:50 BoogieIcfgContainer [2022-02-21 04:17:50,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:17:50,848 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:17:50,848 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:17:50,851 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:17:50,852 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:17:50,852 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:17:49" (1/3) ... [2022-02-21 04:17:50,853 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49d820cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:17:50, skipping insertion in model container [2022-02-21 04:17:50,853 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:17:50,853 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:50" (2/3) ... [2022-02-21 04:17:50,853 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49d820cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:17:50, skipping insertion in model container [2022-02-21 04:17:50,853 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:17:50,853 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:17:50" (3/3) ... [2022-02-21 04:17:50,854 INFO L388 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product33.cil.c [2022-02-21 04:17:50,890 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:17:50,890 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:17:50,890 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:17:50,890 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:17:50,891 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:17:50,891 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:17:50,891 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:17:50,891 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:17:50,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 105 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 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) [2022-02-21 04:17:50,961 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2022-02-21 04:17:50,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:17:50,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:17:50,966 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:17:50,966 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:17:50,966 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:17:50,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 105 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 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) [2022-02-21 04:17:50,985 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2022-02-21 04:17:50,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:17:50,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:17:50,987 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:17:50,988 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:17:51,008 INFO L791 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1; 30#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret27#1, main_~retValue_acc~3#1, main_~tmp~3#1;havoc main_~retValue_acc~3#1;havoc main_~tmp~3#1;assume { :begin_inline_select_helpers } true; 6#L542true assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 70#L535true assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~5#1;havoc valid_product_~retValue_acc~5#1;valid_product_~retValue_acc~5#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~5#1; 107#L550true main_#t~ret27#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~3#1 := main_#t~ret27#1;havoc main_#t~ret27#1; 95#L506true assume 0 != main_~tmp~3#1;assume { :begin_inline_setup } true; 53#L479true assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet29#1, test_#t~nondet30#1, test_#t~nondet31#1, test_#t~nondet32#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; 49#L565-2true [2022-02-21 04:17:51,010 INFO L793 eck$LassoCheckResult]: Loop: 49#L565-2true assume !false; 89#L566true assume test_~splverifierCounter~0#1 < 4; 36#L567true test_~tmp~4#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; 11#L575true assume !(0 != test_~tmp~4#1); 12#L575-2true test_~tmp___0~0#1 := test_#t~nondet30#1;havoc test_#t~nondet30#1; 59#L585true assume !(0 != test_~tmp___0~0#1); 32#L585-2true test_~tmp___2~0#1 := test_#t~nondet31#1;havoc test_#t~nondet31#1; 106#L595true assume 0 != test_~tmp___2~0#1; 60#L601-2true assume { :begin_inline_timeShift } true; 43#L730true assume !(0 != ~pumpRunning~0); 42#L730-2true assume !(0 != ~systemActive~0); 28#L737-1true assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret49#1, __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_~tmp~7#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification4_spec__1_~tmp~7#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; 47#L700true __utac_acc__Specification4_spec__1_#t~ret49#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~7#1 := __utac_acc__Specification4_spec__1_#t~ret49#1;havoc __utac_acc__Specification4_spec__1_#t~ret49#1; 97#L892true assume !(0 == __utac_acc__Specification4_spec__1_~tmp~7#1); 65#L892-1true assume { :end_inline___utac_acc__Specification4_spec__1 } true; 10#L747true assume { :end_inline_timeShift } true; 49#L565-2true [2022-02-21 04:17:51,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:17:51,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 1 times [2022-02-21 04:17:51,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:17:51,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876036214] [2022-02-21 04:17:51,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:17:51,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:17:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:51,125 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:17:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:51,175 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:17:51,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:17:51,178 INFO L85 PathProgramCache]: Analyzing trace with hash -680968892, now seen corresponding path program 1 times [2022-02-21 04:17:51,178 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:17:51,178 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968102441] [2022-02-21 04:17:51,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:17:51,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:17:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:51,185 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:17:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:51,191 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:17:51,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:17:51,200 INFO L85 PathProgramCache]: Analyzing trace with hash 674450184, now seen corresponding path program 1 times [2022-02-21 04:17:51,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:17:51,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521865393] [2022-02-21 04:17:51,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:17:51,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:17:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:17:51,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {113#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1; {115#(= 1 ~systemActive~0)} is VALID [2022-02-21 04:17:51,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#(= 1 ~systemActive~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret27#1, main_~retValue_acc~3#1, main_~tmp~3#1;havoc main_~retValue_acc~3#1;havoc main_~tmp~3#1;assume { :begin_inline_select_helpers } true; {115#(= 1 ~systemActive~0)} is VALID [2022-02-21 04:17:51,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {115#(= 1 ~systemActive~0)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {115#(= 1 ~systemActive~0)} is VALID [2022-02-21 04:17:51,352 INFO L290 TraceCheckUtils]: 3: Hoare triple {115#(= 1 ~systemActive~0)} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~5#1;havoc valid_product_~retValue_acc~5#1;valid_product_~retValue_acc~5#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~5#1; {116#(= |ULTIMATE.start_valid_product_#res#1| ~systemActive~0)} is VALID [2022-02-21 04:17:51,352 INFO L290 TraceCheckUtils]: 4: Hoare triple {116#(= |ULTIMATE.start_valid_product_#res#1| ~systemActive~0)} main_#t~ret27#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~3#1 := main_#t~ret27#1;havoc main_#t~ret27#1; {117#(= |ULTIMATE.start_main_~tmp~3#1| ~systemActive~0)} is VALID [2022-02-21 04:17:51,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {117#(= |ULTIMATE.start_main_~tmp~3#1| ~systemActive~0)} assume 0 != main_~tmp~3#1;assume { :begin_inline_setup } true; {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:51,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#(not (= 0 ~systemActive~0))} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet29#1, test_#t~nondet30#1, test_#t~nondet31#1, test_#t~nondet32#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:51,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {118#(not (= 0 ~systemActive~0))} assume !false; {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:51,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {118#(not (= 0 ~systemActive~0))} assume test_~splverifierCounter~0#1 < 4; {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:51,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {118#(not (= 0 ~systemActive~0))} test_~tmp~4#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:51,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {118#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp~4#1); {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:51,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {118#(not (= 0 ~systemActive~0))} test_~tmp___0~0#1 := test_#t~nondet30#1;havoc test_#t~nondet30#1; {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:51,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {118#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp___0~0#1); {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:51,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {118#(not (= 0 ~systemActive~0))} test_~tmp___2~0#1 := test_#t~nondet31#1;havoc test_#t~nondet31#1; {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:51,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {118#(not (= 0 ~systemActive~0))} assume 0 != test_~tmp___2~0#1; {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:51,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {118#(not (= 0 ~systemActive~0))} assume { :begin_inline_timeShift } true; {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:51,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {118#(not (= 0 ~systemActive~0))} assume !(0 != ~pumpRunning~0); {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:51,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {118#(not (= 0 ~systemActive~0))} assume !(0 != ~systemActive~0); {114#false} is VALID [2022-02-21 04:17:51,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {114#false} assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret49#1, __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_~tmp~7#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification4_spec__1_~tmp~7#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {114#false} is VALID [2022-02-21 04:17:51,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {114#false} __utac_acc__Specification4_spec__1_#t~ret49#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~7#1 := __utac_acc__Specification4_spec__1_#t~ret49#1;havoc __utac_acc__Specification4_spec__1_#t~ret49#1; {114#false} is VALID [2022-02-21 04:17:51,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {114#false} assume !(0 == __utac_acc__Specification4_spec__1_~tmp~7#1); {114#false} is VALID [2022-02-21 04:17:51,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {114#false} assume { :end_inline___utac_acc__Specification4_spec__1 } true; {114#false} is VALID [2022-02-21 04:17:51,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {114#false} assume { :end_inline_timeShift } true; {114#false} is VALID [2022-02-21 04:17:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:17:51,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:17:51,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521865393] [2022-02-21 04:17:51,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521865393] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:17:51,364 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:17:51,364 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:17:51,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508887352] [2022-02-21 04:17:51,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:17:51,474 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:17:51,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 04:17:51,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 04:17:51,499 INFO L87 Difference]: Start difference. First operand has 105 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 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 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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) [2022-02-21 04:17:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:17:51,743 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2022-02-21 04:17:51,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:17:51,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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) [2022-02-21 04:17:51,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:17:51,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 130 transitions. [2022-02-21 04:17:51,771 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2022-02-21 04:17:51,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 92 states and 120 transitions. [2022-02-21 04:17:51,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2022-02-21 04:17:51,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2022-02-21 04:17:51,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 120 transitions. [2022-02-21 04:17:51,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:17:51,777 INFO L681 BuchiCegarLoop]: Abstraction has 92 states and 120 transitions. [2022-02-21 04:17:51,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 120 transitions. [2022-02-21 04:17:51,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-02-21 04:17:51,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:17:51,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states and 120 transitions. Second operand has 92 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 91 states have internal predecessors, (120), 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) [2022-02-21 04:17:51,797 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states and 120 transitions. Second operand has 92 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 91 states have internal predecessors, (120), 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) [2022-02-21 04:17:51,798 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand has 92 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 91 states have internal predecessors, (120), 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) [2022-02-21 04:17:51,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:17:51,801 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2022-02-21 04:17:51,801 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2022-02-21 04:17:51,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:17:51,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:17:51,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 91 states have internal predecessors, (120), 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 92 states and 120 transitions. [2022-02-21 04:17:51,803 INFO L87 Difference]: Start difference. First operand has 92 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 91 states have internal predecessors, (120), 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 92 states and 120 transitions. [2022-02-21 04:17:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:17:51,805 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2022-02-21 04:17:51,805 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2022-02-21 04:17:51,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:17:51,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:17:51,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:17:51,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:17:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 91 states have internal predecessors, (120), 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) [2022-02-21 04:17:51,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2022-02-21 04:17:51,809 INFO L704 BuchiCegarLoop]: Abstraction has 92 states and 120 transitions. [2022-02-21 04:17:51,810 INFO L587 BuchiCegarLoop]: Abstraction has 92 states and 120 transitions. [2022-02-21 04:17:51,810 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:17:51,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 120 transitions. [2022-02-21 04:17:51,811 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2022-02-21 04:17:51,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:17:51,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:17:51,811 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:17:51,811 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] [2022-02-21 04:17:51,812 INFO L791 eck$LassoCheckResult]: Stem: 314#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1; 298#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret27#1, main_~retValue_acc~3#1, main_~tmp~3#1;havoc main_~retValue_acc~3#1;havoc main_~tmp~3#1;assume { :begin_inline_select_helpers } true; 237#L542 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 238#L535 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~5#1;havoc valid_product_~retValue_acc~5#1;valid_product_~retValue_acc~5#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~5#1; 272#L550 main_#t~ret27#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~3#1 := main_#t~ret27#1;havoc main_#t~ret27#1; 309#L506 assume 0 != main_~tmp~3#1;assume { :begin_inline_setup } true; 310#L479 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet29#1, test_#t~nondet30#1, test_#t~nondet31#1, test_#t~nondet32#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; 250#L565-2 [2022-02-21 04:17:51,812 INFO L793 eck$LassoCheckResult]: Loop: 250#L565-2 assume !false; 299#L566 assume test_~splverifierCounter~0#1 < 4; 300#L567 test_~tmp~4#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; 251#L575 assume !(0 != test_~tmp~4#1); 253#L575-2 test_~tmp___0~0#1 := test_#t~nondet30#1;havoc test_#t~nondet30#1; 241#L585 assume !(0 != test_~tmp___0~0#1); 243#L585-2 test_~tmp___2~0#1 := test_#t~nondet31#1;havoc test_#t~nondet31#1; 302#L595 assume 0 != test_~tmp___2~0#1; 245#L601-2 assume { :begin_inline_timeShift } true; 246#L730 assume !(0 != ~pumpRunning~0); 273#L730-2 assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret38#1, processEnvironment_~tmp~5#1;havoc processEnvironment_~tmp~5#1; 277#L762 assume !(0 == ~pumpRunning~0);assume { :begin_inline_processEnvironment__wrappee__base } true; 265#L754-1 assume { :end_inline_processEnvironment__wrappee__base } true; 228#L762-1 assume { :end_inline_processEnvironment } true; 293#L737-1 assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret49#1, __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_~tmp~7#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification4_spec__1_~tmp~7#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; 296#L700 __utac_acc__Specification4_spec__1_#t~ret49#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~7#1 := __utac_acc__Specification4_spec__1_#t~ret49#1;havoc __utac_acc__Specification4_spec__1_#t~ret49#1; 312#L892 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~7#1); 244#L892-1 assume { :end_inline___utac_acc__Specification4_spec__1 } true; 249#L747 assume { :end_inline_timeShift } true; 250#L565-2 [2022-02-21 04:17:51,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:17:51,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 2 times [2022-02-21 04:17:51,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:17:51,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123996315] [2022-02-21 04:17:51,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:17:51,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:17:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:51,825 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:17:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:51,846 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:17:51,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:17:51,847 INFO L85 PathProgramCache]: Analyzing trace with hash -232248349, now seen corresponding path program 1 times [2022-02-21 04:17:51,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:17:51,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420782218] [2022-02-21 04:17:51,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:17:51,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:17:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:17:51,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {506#true} assume !false; {506#true} is VALID [2022-02-21 04:17:51,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#true} assume test_~splverifierCounter~0#1 < 4; {506#true} is VALID [2022-02-21 04:17:51,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#true} test_~tmp~4#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; {506#true} is VALID [2022-02-21 04:17:51,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {506#true} assume !(0 != test_~tmp~4#1); {506#true} is VALID [2022-02-21 04:17:51,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {506#true} test_~tmp___0~0#1 := test_#t~nondet30#1;havoc test_#t~nondet30#1; {506#true} is VALID [2022-02-21 04:17:51,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#true} assume !(0 != test_~tmp___0~0#1); {506#true} is VALID [2022-02-21 04:17:51,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#true} test_~tmp___2~0#1 := test_#t~nondet31#1;havoc test_#t~nondet31#1; {506#true} is VALID [2022-02-21 04:17:51,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {506#true} assume 0 != test_~tmp___2~0#1; {506#true} is VALID [2022-02-21 04:17:51,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {506#true} assume { :begin_inline_timeShift } true; {506#true} is VALID [2022-02-21 04:17:51,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {506#true} assume !(0 != ~pumpRunning~0); {508#(= ~pumpRunning~0 0)} is VALID [2022-02-21 04:17:51,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {508#(= ~pumpRunning~0 0)} assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret38#1, processEnvironment_~tmp~5#1;havoc processEnvironment_~tmp~5#1; {508#(= ~pumpRunning~0 0)} is VALID [2022-02-21 04:17:51,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#(= ~pumpRunning~0 0)} assume !(0 == ~pumpRunning~0);assume { :begin_inline_processEnvironment__wrappee__base } true; {507#false} is VALID [2022-02-21 04:17:51,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {507#false} assume { :end_inline_processEnvironment__wrappee__base } true; {507#false} is VALID [2022-02-21 04:17:51,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {507#false} assume { :end_inline_processEnvironment } true; {507#false} is VALID [2022-02-21 04:17:51,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#false} assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret49#1, __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_~tmp~7#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification4_spec__1_~tmp~7#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {507#false} is VALID [2022-02-21 04:17:51,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {507#false} __utac_acc__Specification4_spec__1_#t~ret49#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~7#1 := __utac_acc__Specification4_spec__1_#t~ret49#1;havoc __utac_acc__Specification4_spec__1_#t~ret49#1; {507#false} is VALID [2022-02-21 04:17:51,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#false} assume !(0 == __utac_acc__Specification4_spec__1_~tmp~7#1); {507#false} is VALID [2022-02-21 04:17:51,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {507#false} assume { :end_inline___utac_acc__Specification4_spec__1 } true; {507#false} is VALID [2022-02-21 04:17:51,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {507#false} assume { :end_inline_timeShift } true; {507#false} is VALID [2022-02-21 04:17:51,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:17:51,881 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:17:51,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420782218] [2022-02-21 04:17:51,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420782218] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:17:51,882 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:17:51,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:17:51,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510309032] [2022-02-21 04:17:51,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:17:51,883 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:17:51,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:17:51,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:17:51,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:17:51,884 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. cyclomatic complexity: 30 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-02-21 04:17:52,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:17:52,053 INFO L93 Difference]: Finished difference Result 144 states and 182 transitions. [2022-02-21 04:17:52,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:17:52,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-02-21 04:17:52,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:17:52,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 182 transitions. [2022-02-21 04:17:52,077 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 102 [2022-02-21 04:17:52,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 144 states and 182 transitions. [2022-02-21 04:17:52,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2022-02-21 04:17:52,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 144 [2022-02-21 04:17:52,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 182 transitions. [2022-02-21 04:17:52,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:17:52,085 INFO L681 BuchiCegarLoop]: Abstraction has 144 states and 182 transitions. [2022-02-21 04:17:52,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 182 transitions. [2022-02-21 04:17:52,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-02-21 04:17:52,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:17:52,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states and 182 transitions. Second operand has 144 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 143 states have internal predecessors, (182), 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) [2022-02-21 04:17:52,103 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states and 182 transitions. Second operand has 144 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 143 states have internal predecessors, (182), 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) [2022-02-21 04:17:52,103 INFO L87 Difference]: Start difference. First operand 144 states and 182 transitions. Second operand has 144 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 143 states have internal predecessors, (182), 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) [2022-02-21 04:17:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:17:52,109 INFO L93 Difference]: Finished difference Result 144 states and 182 transitions. [2022-02-21 04:17:52,109 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions. [2022-02-21 04:17:52,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:17:52,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:17:52,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 143 states have internal predecessors, (182), 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 144 states and 182 transitions. [2022-02-21 04:17:52,116 INFO L87 Difference]: Start difference. First operand has 144 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 143 states have internal predecessors, (182), 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 144 states and 182 transitions. [2022-02-21 04:17:52,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:17:52,120 INFO L93 Difference]: Finished difference Result 144 states and 182 transitions. [2022-02-21 04:17:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions. [2022-02-21 04:17:52,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:17:52,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:17:52,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:17:52,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:17:52,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 143 states have internal predecessors, (182), 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) [2022-02-21 04:17:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 182 transitions. [2022-02-21 04:17:52,125 INFO L704 BuchiCegarLoop]: Abstraction has 144 states and 182 transitions. [2022-02-21 04:17:52,125 INFO L587 BuchiCegarLoop]: Abstraction has 144 states and 182 transitions. [2022-02-21 04:17:52,125 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:17:52,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 144 states and 182 transitions. [2022-02-21 04:17:52,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 102 [2022-02-21 04:17:52,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:17:52,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:17:52,127 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:17:52,127 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, 1, 1, 1, 1, 1] [2022-02-21 04:17:52,128 INFO L791 eck$LassoCheckResult]: Stem: 748#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1; 730#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret27#1, main_~retValue_acc~3#1, main_~tmp~3#1;havoc main_~retValue_acc~3#1;havoc main_~tmp~3#1;assume { :begin_inline_select_helpers } true; 665#L542 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 666#L535 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~5#1;havoc valid_product_~retValue_acc~5#1;valid_product_~retValue_acc~5#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~5#1; 702#L550 main_#t~ret27#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~3#1 := main_#t~ret27#1;havoc main_#t~ret27#1; 741#L506 assume 0 != main_~tmp~3#1;assume { :begin_inline_setup } true; 742#L479 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet29#1, test_#t~nondet30#1, test_#t~nondet31#1, test_#t~nondet32#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; 751#L565-2 [2022-02-21 04:17:52,128 INFO L793 eck$LassoCheckResult]: Loop: 751#L565-2 assume !false; 731#L566 assume test_~splverifierCounter~0#1 < 4; 732#L567 test_~tmp~4#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; 679#L575 assume !(0 != test_~tmp~4#1); 681#L575-2 test_~tmp___0~0#1 := test_#t~nondet30#1;havoc test_#t~nondet30#1; 669#L585 assume !(0 != test_~tmp___0~0#1); 671#L585-2 test_~tmp___2~0#1 := test_#t~nondet31#1;havoc test_#t~nondet31#1; 734#L595 assume 0 != test_~tmp___2~0#1; 673#L601-2 assume { :begin_inline_timeShift } true; 674#L730 assume !(0 != ~pumpRunning~0); 746#L730-2 assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret38#1, processEnvironment_~tmp~5#1;havoc processEnvironment_~tmp~5#1; 708#L762 assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret48#1, isHighWaterLevel_~retValue_acc~11#1, isHighWaterLevel_~tmp~6#1, isHighWaterLevel_~tmp___0~1#1;havoc isHighWaterLevel_~retValue_acc~11#1;havoc isHighWaterLevel_~tmp~6#1;havoc isHighWaterLevel_~tmp___0~1#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~8#1;havoc isHighWaterSensorDry_~retValue_acc~8#1; 675#L708 assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~8#1 := 0;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~8#1; 676#L713 isHighWaterLevel_#t~ret48#1 := isHighWaterSensorDry_#res#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~6#1 := isHighWaterLevel_#t~ret48#1;havoc isHighWaterLevel_#t~ret48#1; 723#L864 assume 0 != isHighWaterLevel_~tmp~6#1;isHighWaterLevel_~tmp___0~1#1 := 0; 739#L864-2 isHighWaterLevel_~retValue_acc~11#1 := isHighWaterLevel_~tmp___0~1#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~11#1; 686#L870 processEnvironment_#t~ret38#1 := isHighWaterLevel_#res#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~5#1 := processEnvironment_#t~ret38#1;havoc processEnvironment_#t~ret38#1; 659#L766 assume !(0 != processEnvironment_~tmp~5#1);assume { :begin_inline_processEnvironment__wrappee__base } true; 655#L754 assume { :end_inline_processEnvironment__wrappee__base } true; 656#L762-1 assume { :end_inline_processEnvironment } true; 725#L737-1 assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret49#1, __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_~tmp~7#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification4_spec__1_~tmp~7#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; 728#L700 __utac_acc__Specification4_spec__1_#t~ret49#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~7#1 := __utac_acc__Specification4_spec__1_#t~ret49#1;havoc __utac_acc__Specification4_spec__1_#t~ret49#1; 743#L892 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~7#1); 672#L892-1 assume { :end_inline___utac_acc__Specification4_spec__1 } true; 768#L747 assume { :end_inline_timeShift } true; 751#L565-2 [2022-02-21 04:17:52,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:17:52,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 3 times [2022-02-21 04:17:52,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:17:52,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601809788] [2022-02-21 04:17:52,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:17:52,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:17:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:52,140 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:17:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:52,152 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:17:52,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:17:52,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1748467795, now seen corresponding path program 1 times [2022-02-21 04:17:52,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:17:52,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553888275] [2022-02-21 04:17:52,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:17:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:17:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:17:52,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {1090#true} assume !false; {1090#true} is VALID [2022-02-21 04:17:52,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {1090#true} assume test_~splverifierCounter~0#1 < 4; {1090#true} is VALID [2022-02-21 04:17:52,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {1090#true} test_~tmp~4#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; {1090#true} is VALID [2022-02-21 04:17:52,181 INFO L290 TraceCheckUtils]: 3: Hoare triple {1090#true} assume !(0 != test_~tmp~4#1); {1090#true} is VALID [2022-02-21 04:17:52,181 INFO L290 TraceCheckUtils]: 4: Hoare triple {1090#true} test_~tmp___0~0#1 := test_#t~nondet30#1;havoc test_#t~nondet30#1; {1090#true} is VALID [2022-02-21 04:17:52,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {1090#true} assume !(0 != test_~tmp___0~0#1); {1090#true} is VALID [2022-02-21 04:17:52,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {1090#true} test_~tmp___2~0#1 := test_#t~nondet31#1;havoc test_#t~nondet31#1; {1090#true} is VALID [2022-02-21 04:17:52,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {1090#true} assume 0 != test_~tmp___2~0#1; {1090#true} is VALID [2022-02-21 04:17:52,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {1090#true} assume { :begin_inline_timeShift } true; {1090#true} is VALID [2022-02-21 04:17:52,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {1090#true} assume !(0 != ~pumpRunning~0); {1090#true} is VALID [2022-02-21 04:17:52,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {1090#true} assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret38#1, processEnvironment_~tmp~5#1;havoc processEnvironment_~tmp~5#1; {1090#true} is VALID [2022-02-21 04:17:52,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {1090#true} assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret48#1, isHighWaterLevel_~retValue_acc~11#1, isHighWaterLevel_~tmp~6#1, isHighWaterLevel_~tmp___0~1#1;havoc isHighWaterLevel_~retValue_acc~11#1;havoc isHighWaterLevel_~tmp~6#1;havoc isHighWaterLevel_~tmp___0~1#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~8#1;havoc isHighWaterSensorDry_~retValue_acc~8#1; {1090#true} is VALID [2022-02-21 04:17:52,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {1090#true} assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~8#1 := 0;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~8#1; {1092#(= |ULTIMATE.start_isHighWaterSensorDry_#res#1| 0)} is VALID [2022-02-21 04:17:52,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {1092#(= |ULTIMATE.start_isHighWaterSensorDry_#res#1| 0)} isHighWaterLevel_#t~ret48#1 := isHighWaterSensorDry_#res#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~6#1 := isHighWaterLevel_#t~ret48#1;havoc isHighWaterLevel_#t~ret48#1; {1093#(= |ULTIMATE.start_isHighWaterLevel_~tmp~6#1| 0)} is VALID [2022-02-21 04:17:52,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {1093#(= |ULTIMATE.start_isHighWaterLevel_~tmp~6#1| 0)} assume 0 != isHighWaterLevel_~tmp~6#1;isHighWaterLevel_~tmp___0~1#1 := 0; {1091#false} is VALID [2022-02-21 04:17:52,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {1091#false} isHighWaterLevel_~retValue_acc~11#1 := isHighWaterLevel_~tmp___0~1#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~11#1; {1091#false} is VALID [2022-02-21 04:17:52,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {1091#false} processEnvironment_#t~ret38#1 := isHighWaterLevel_#res#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~5#1 := processEnvironment_#t~ret38#1;havoc processEnvironment_#t~ret38#1; {1091#false} is VALID [2022-02-21 04:17:52,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {1091#false} assume !(0 != processEnvironment_~tmp~5#1);assume { :begin_inline_processEnvironment__wrappee__base } true; {1091#false} is VALID [2022-02-21 04:17:52,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {1091#false} assume { :end_inline_processEnvironment__wrappee__base } true; {1091#false} is VALID [2022-02-21 04:17:52,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {1091#false} assume { :end_inline_processEnvironment } true; {1091#false} is VALID [2022-02-21 04:17:52,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {1091#false} assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret49#1, __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_~tmp~7#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification4_spec__1_~tmp~7#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {1091#false} is VALID [2022-02-21 04:17:52,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {1091#false} __utac_acc__Specification4_spec__1_#t~ret49#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~7#1 := __utac_acc__Specification4_spec__1_#t~ret49#1;havoc __utac_acc__Specification4_spec__1_#t~ret49#1; {1091#false} is VALID [2022-02-21 04:17:52,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {1091#false} assume !(0 == __utac_acc__Specification4_spec__1_~tmp~7#1); {1091#false} is VALID [2022-02-21 04:17:52,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {1091#false} assume { :end_inline___utac_acc__Specification4_spec__1 } true; {1091#false} is VALID [2022-02-21 04:17:52,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {1091#false} assume { :end_inline_timeShift } true; {1091#false} is VALID [2022-02-21 04:17:52,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:17:52,184 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:17:52,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553888275] [2022-02-21 04:17:52,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553888275] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:17:52,185 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:17:52,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:17:52,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038875217] [2022-02-21 04:17:52,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:17:52,196 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:17:52,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:17:52,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:17:52,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:17:52,196 INFO L87 Difference]: Start difference. First operand 144 states and 182 transitions. cyclomatic complexity: 40 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2022-02-21 04:17:52,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:17:52,528 INFO L93 Difference]: Finished difference Result 406 states and 508 transitions. [2022-02-21 04:17:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:17:52,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2022-02-21 04:17:52,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:17:52,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 406 states and 508 transitions. [2022-02-21 04:17:52,557 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 298 [2022-02-21 04:17:52,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 406 states to 406 states and 508 transitions. [2022-02-21 04:17:52,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 406 [2022-02-21 04:17:52,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 406 [2022-02-21 04:17:52,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 406 states and 508 transitions. [2022-02-21 04:17:52,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:17:52,569 INFO L681 BuchiCegarLoop]: Abstraction has 406 states and 508 transitions. [2022-02-21 04:17:52,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states and 508 transitions. [2022-02-21 04:17:52,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 150. [2022-02-21 04:17:52,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:17:52,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 406 states and 508 transitions. Second operand has 150 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 149 states have internal predecessors, (188), 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) [2022-02-21 04:17:52,575 INFO L74 IsIncluded]: Start isIncluded. First operand 406 states and 508 transitions. Second operand has 150 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 149 states have internal predecessors, (188), 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) [2022-02-21 04:17:52,576 INFO L87 Difference]: Start difference. First operand 406 states and 508 transitions. Second operand has 150 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 149 states have internal predecessors, (188), 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) [2022-02-21 04:17:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:17:52,585 INFO L93 Difference]: Finished difference Result 406 states and 508 transitions. [2022-02-21 04:17:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 508 transitions. [2022-02-21 04:17:52,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:17:52,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:17:52,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 149 states have internal predecessors, (188), 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 406 states and 508 transitions. [2022-02-21 04:17:52,587 INFO L87 Difference]: Start difference. First operand has 150 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 149 states have internal predecessors, (188), 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 406 states and 508 transitions. [2022-02-21 04:17:52,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:17:52,597 INFO L93 Difference]: Finished difference Result 406 states and 508 transitions. [2022-02-21 04:17:52,597 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 508 transitions. [2022-02-21 04:17:52,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:17:52,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:17:52,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:17:52,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:17:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 149 states have internal predecessors, (188), 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) [2022-02-21 04:17:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 188 transitions. [2022-02-21 04:17:52,601 INFO L704 BuchiCegarLoop]: Abstraction has 150 states and 188 transitions. [2022-02-21 04:17:52,601 INFO L587 BuchiCegarLoop]: Abstraction has 150 states and 188 transitions. [2022-02-21 04:17:52,601 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:17:52,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 188 transitions. [2022-02-21 04:17:52,602 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 106 [2022-02-21 04:17:52,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:17:52,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:17:52,602 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:17:52,603 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, 1, 1, 1, 1, 1] [2022-02-21 04:17:52,603 INFO L791 eck$LassoCheckResult]: Stem: 1607#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1; 1583#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret27#1, main_~retValue_acc~3#1, main_~tmp~3#1;havoc main_~retValue_acc~3#1;havoc main_~tmp~3#1;assume { :begin_inline_select_helpers } true; 1513#L542 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 1514#L535 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~5#1;havoc valid_product_~retValue_acc~5#1;valid_product_~retValue_acc~5#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~5#1; 1553#L550 main_#t~ret27#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~3#1 := main_#t~ret27#1;havoc main_#t~ret27#1; 1600#L506 assume 0 != main_~tmp~3#1;assume { :begin_inline_setup } true; 1601#L479 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet29#1, test_#t~nondet30#1, test_#t~nondet31#1, test_#t~nondet32#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; 1530#L565-2 [2022-02-21 04:17:52,603 INFO L793 eck$LassoCheckResult]: Loop: 1530#L565-2 assume !false; 1586#L566 assume test_~splverifierCounter~0#1 < 4; 1587#L567 test_~tmp~4#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; 1531#L575 assume !(0 != test_~tmp~4#1); 1533#L575-2 test_~tmp___0~0#1 := test_#t~nondet30#1;havoc test_#t~nondet30#1; 1519#L585 assume !(0 != test_~tmp___0~0#1); 1521#L585-2 test_~tmp___2~0#1 := test_#t~nondet31#1;havoc test_#t~nondet31#1; 1589#L595 assume 0 != test_~tmp___2~0#1; 1524#L601-2 assume { :begin_inline_timeShift } true; 1525#L730 assume !(0 != ~pumpRunning~0); 1606#L730-2 assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret38#1, processEnvironment_~tmp~5#1;havoc processEnvironment_~tmp~5#1; 1561#L762 assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret48#1, isHighWaterLevel_~retValue_acc~11#1, isHighWaterLevel_~tmp~6#1, isHighWaterLevel_~tmp___0~1#1;havoc isHighWaterLevel_~retValue_acc~11#1;havoc isHighWaterLevel_~tmp~6#1;havoc isHighWaterLevel_~tmp___0~1#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~8#1;havoc isHighWaterSensorDry_~retValue_acc~8#1; 1526#L708 assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~8#1 := 0;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~8#1; 1527#L713 isHighWaterLevel_#t~ret48#1 := isHighWaterSensorDry_#res#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~6#1 := isHighWaterLevel_#t~ret48#1;havoc isHighWaterLevel_#t~ret48#1; 1595#L864 assume !(0 != isHighWaterLevel_~tmp~6#1);isHighWaterLevel_~tmp___0~1#1 := 1; 1596#L864-2 isHighWaterLevel_~retValue_acc~11#1 := isHighWaterLevel_~tmp___0~1#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~11#1; 1538#L870 processEnvironment_#t~ret38#1 := isHighWaterLevel_#res#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~5#1 := processEnvironment_#t~ret38#1;havoc processEnvironment_#t~ret38#1; 1509#L766 assume !(0 != processEnvironment_~tmp~5#1);assume { :begin_inline_processEnvironment__wrappee__base } true; 1505#L754 assume { :end_inline_processEnvironment__wrappee__base } true; 1506#L762-1 assume { :end_inline_processEnvironment } true; 1640#L737-1 assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret49#1, __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_~tmp~7#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification4_spec__1_~tmp~7#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; 1639#L700 __utac_acc__Specification4_spec__1_#t~ret49#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~7#1 := __utac_acc__Specification4_spec__1_#t~ret49#1;havoc __utac_acc__Specification4_spec__1_#t~ret49#1; 1631#L892 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~7#1); 1629#L892-1 assume { :end_inline___utac_acc__Specification4_spec__1 } true; 1529#L747 assume { :end_inline_timeShift } true; 1530#L565-2 [2022-02-21 04:17:52,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:17:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 4 times [2022-02-21 04:17:52,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:17:52,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427844156] [2022-02-21 04:17:52,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:17:52,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:17:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:52,612 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:17:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:52,634 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:17:52,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:17:52,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1047403217, now seen corresponding path program 1 times [2022-02-21 04:17:52,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:17:52,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383347919] [2022-02-21 04:17:52,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:17:52,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:17:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:17:52,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {2470#true} assume !false; {2470#true} is VALID [2022-02-21 04:17:52,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {2470#true} assume test_~splverifierCounter~0#1 < 4; {2470#true} is VALID [2022-02-21 04:17:52,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {2470#true} test_~tmp~4#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; {2470#true} is VALID [2022-02-21 04:17:52,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {2470#true} assume !(0 != test_~tmp~4#1); {2470#true} is VALID [2022-02-21 04:17:52,673 INFO L290 TraceCheckUtils]: 4: Hoare triple {2470#true} test_~tmp___0~0#1 := test_#t~nondet30#1;havoc test_#t~nondet30#1; {2470#true} is VALID [2022-02-21 04:17:52,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {2470#true} assume !(0 != test_~tmp___0~0#1); {2470#true} is VALID [2022-02-21 04:17:52,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {2470#true} test_~tmp___2~0#1 := test_#t~nondet31#1;havoc test_#t~nondet31#1; {2470#true} is VALID [2022-02-21 04:17:52,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {2470#true} assume 0 != test_~tmp___2~0#1; {2470#true} is VALID [2022-02-21 04:17:52,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {2470#true} assume { :begin_inline_timeShift } true; {2470#true} is VALID [2022-02-21 04:17:52,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {2470#true} assume !(0 != ~pumpRunning~0); {2470#true} is VALID [2022-02-21 04:17:52,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {2470#true} assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret38#1, processEnvironment_~tmp~5#1;havoc processEnvironment_~tmp~5#1; {2470#true} is VALID [2022-02-21 04:17:52,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {2470#true} assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret48#1, isHighWaterLevel_~retValue_acc~11#1, isHighWaterLevel_~tmp~6#1, isHighWaterLevel_~tmp___0~1#1;havoc isHighWaterLevel_~retValue_acc~11#1;havoc isHighWaterLevel_~tmp~6#1;havoc isHighWaterLevel_~tmp___0~1#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~8#1;havoc isHighWaterSensorDry_~retValue_acc~8#1; {2470#true} is VALID [2022-02-21 04:17:52,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {2470#true} assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~8#1 := 0;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~8#1; {2470#true} is VALID [2022-02-21 04:17:52,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {2470#true} isHighWaterLevel_#t~ret48#1 := isHighWaterSensorDry_#res#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~6#1 := isHighWaterLevel_#t~ret48#1;havoc isHighWaterLevel_#t~ret48#1; {2470#true} is VALID [2022-02-21 04:17:52,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {2470#true} assume !(0 != isHighWaterLevel_~tmp~6#1);isHighWaterLevel_~tmp___0~1#1 := 1; {2472#(not (= |ULTIMATE.start_isHighWaterLevel_~tmp___0~1#1| 0))} is VALID [2022-02-21 04:17:52,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#(not (= |ULTIMATE.start_isHighWaterLevel_~tmp___0~1#1| 0))} isHighWaterLevel_~retValue_acc~11#1 := isHighWaterLevel_~tmp___0~1#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~11#1; {2473#(not (= |ULTIMATE.start_isHighWaterLevel_#res#1| 0))} is VALID [2022-02-21 04:17:52,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {2473#(not (= |ULTIMATE.start_isHighWaterLevel_#res#1| 0))} processEnvironment_#t~ret38#1 := isHighWaterLevel_#res#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~5#1 := processEnvironment_#t~ret38#1;havoc processEnvironment_#t~ret38#1; {2474#(not (= |ULTIMATE.start_processEnvironment_~tmp~5#1| 0))} is VALID [2022-02-21 04:17:52,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {2474#(not (= |ULTIMATE.start_processEnvironment_~tmp~5#1| 0))} assume !(0 != processEnvironment_~tmp~5#1);assume { :begin_inline_processEnvironment__wrappee__base } true; {2471#false} is VALID [2022-02-21 04:17:52,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {2471#false} assume { :end_inline_processEnvironment__wrappee__base } true; {2471#false} is VALID [2022-02-21 04:17:52,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {2471#false} assume { :end_inline_processEnvironment } true; {2471#false} is VALID [2022-02-21 04:17:52,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {2471#false} assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret49#1, __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_~tmp~7#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification4_spec__1_~tmp~7#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {2471#false} is VALID [2022-02-21 04:17:52,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {2471#false} __utac_acc__Specification4_spec__1_#t~ret49#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~7#1 := __utac_acc__Specification4_spec__1_#t~ret49#1;havoc __utac_acc__Specification4_spec__1_#t~ret49#1; {2471#false} is VALID [2022-02-21 04:17:52,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {2471#false} assume !(0 == __utac_acc__Specification4_spec__1_~tmp~7#1); {2471#false} is VALID [2022-02-21 04:17:52,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {2471#false} assume { :end_inline___utac_acc__Specification4_spec__1 } true; {2471#false} is VALID [2022-02-21 04:17:52,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {2471#false} assume { :end_inline_timeShift } true; {2471#false} is VALID [2022-02-21 04:17:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:17:52,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:17:52,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383347919] [2022-02-21 04:17:52,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383347919] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:17:52,685 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:17:52,685 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:17:52,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156570064] [2022-02-21 04:17:52,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:17:52,687 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:17:52,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:17:52,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:17:52,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:17:52,688 INFO L87 Difference]: Start difference. First operand 150 states and 188 transitions. cyclomatic complexity: 40 Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2022-02-21 04:17:53,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:17:53,136 INFO L93 Difference]: Finished difference Result 345 states and 434 transitions. [2022-02-21 04:17:53,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 04:17:53,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2022-02-21 04:17:53,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:17:53,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 345 states and 434 transitions. [2022-02-21 04:17:53,161 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 252 [2022-02-21 04:17:53,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 345 states to 345 states and 434 transitions. [2022-02-21 04:17:53,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 345 [2022-02-21 04:17:53,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 345 [2022-02-21 04:17:53,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 345 states and 434 transitions. [2022-02-21 04:17:53,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:17:53,172 INFO L681 BuchiCegarLoop]: Abstraction has 345 states and 434 transitions. [2022-02-21 04:17:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states and 434 transitions. [2022-02-21 04:17:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 159. [2022-02-21 04:17:53,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:17:53,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states and 434 transitions. Second operand has 159 states, 159 states have (on average 1.2389937106918238) internal successors, (197), 158 states have internal predecessors, (197), 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) [2022-02-21 04:17:53,176 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states and 434 transitions. Second operand has 159 states, 159 states have (on average 1.2389937106918238) internal successors, (197), 158 states have internal predecessors, (197), 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) [2022-02-21 04:17:53,176 INFO L87 Difference]: Start difference. First operand 345 states and 434 transitions. Second operand has 159 states, 159 states have (on average 1.2389937106918238) internal successors, (197), 158 states have internal predecessors, (197), 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) [2022-02-21 04:17:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:17:53,184 INFO L93 Difference]: Finished difference Result 345 states and 434 transitions. [2022-02-21 04:17:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 434 transitions. [2022-02-21 04:17:53,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:17:53,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:17:53,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 159 states have (on average 1.2389937106918238) internal successors, (197), 158 states have internal predecessors, (197), 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 345 states and 434 transitions. [2022-02-21 04:17:53,185 INFO L87 Difference]: Start difference. First operand has 159 states, 159 states have (on average 1.2389937106918238) internal successors, (197), 158 states have internal predecessors, (197), 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 345 states and 434 transitions. [2022-02-21 04:17:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:17:53,193 INFO L93 Difference]: Finished difference Result 345 states and 434 transitions. [2022-02-21 04:17:53,193 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 434 transitions. [2022-02-21 04:17:53,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:17:53,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:17:53,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:17:53,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:17:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 159 states have (on average 1.2389937106918238) internal successors, (197), 158 states have internal predecessors, (197), 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) [2022-02-21 04:17:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 197 transitions. [2022-02-21 04:17:53,197 INFO L704 BuchiCegarLoop]: Abstraction has 159 states and 197 transitions. [2022-02-21 04:17:53,197 INFO L587 BuchiCegarLoop]: Abstraction has 159 states and 197 transitions. [2022-02-21 04:17:53,197 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:17:53,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 197 transitions. [2022-02-21 04:17:53,197 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 112 [2022-02-21 04:17:53,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:17:53,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:17:53,198 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:17:53,198 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, 1, 1, 1, 1, 1] [2022-02-21 04:17:53,198 INFO L791 eck$LassoCheckResult]: Stem: 2928#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1; 2907#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret27#1, main_~retValue_acc~3#1, main_~tmp~3#1;havoc main_~retValue_acc~3#1;havoc main_~tmp~3#1;assume { :begin_inline_select_helpers } true; 2838#L542 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 2839#L535 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~5#1;havoc valid_product_~retValue_acc~5#1;valid_product_~retValue_acc~5#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~5#1; 2875#L550 main_#t~ret27#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~3#1 := main_#t~ret27#1;havoc main_#t~ret27#1; 2922#L506 assume 0 != main_~tmp~3#1;assume { :begin_inline_setup } true; 2923#L479 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet29#1, test_#t~nondet30#1, test_#t~nondet31#1, test_#t~nondet32#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; 2939#L565-2 [2022-02-21 04:17:53,207 INFO L793 eck$LassoCheckResult]: Loop: 2939#L565-2 assume !false; 2908#L566 assume test_~splverifierCounter~0#1 < 4; 2909#L567 test_~tmp~4#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; 2977#L575 assume !(0 != test_~tmp~4#1); 2975#L575-2 test_~tmp___0~0#1 := test_#t~nondet30#1;havoc test_#t~nondet30#1; 2843#L585 assume !(0 != test_~tmp___0~0#1); 2845#L585-2 test_~tmp___2~0#1 := test_#t~nondet31#1;havoc test_#t~nondet31#1; 2911#L595 assume 0 != test_~tmp___2~0#1; 2846#L601-2 assume { :begin_inline_timeShift } true; 2847#L730 assume !(0 != ~pumpRunning~0); 2930#L730-2 assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret38#1, processEnvironment_~tmp~5#1;havoc processEnvironment_~tmp~5#1; 2881#L762 assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret48#1, isHighWaterLevel_~retValue_acc~11#1, isHighWaterLevel_~tmp~6#1, isHighWaterLevel_~tmp___0~1#1;havoc isHighWaterLevel_~retValue_acc~11#1;havoc isHighWaterLevel_~tmp~6#1;havoc isHighWaterLevel_~tmp___0~1#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~8#1;havoc isHighWaterSensorDry_~retValue_acc~8#1; 2848#L708 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~8#1 := 1;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~8#1; 2850#L713 isHighWaterLevel_#t~ret48#1 := isHighWaterSensorDry_#res#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~6#1 := isHighWaterLevel_#t~ret48#1;havoc isHighWaterLevel_#t~ret48#1; 2946#L864 assume 0 != isHighWaterLevel_~tmp~6#1;isHighWaterLevel_~tmp___0~1#1 := 0; 2944#L864-2 isHighWaterLevel_~retValue_acc~11#1 := isHighWaterLevel_~tmp___0~1#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~11#1; 2942#L870 processEnvironment_#t~ret38#1 := isHighWaterLevel_#res#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~5#1 := processEnvironment_#t~ret38#1;havoc processEnvironment_#t~ret38#1; 2940#L766 assume !(0 != processEnvironment_~tmp~5#1);assume { :begin_inline_processEnvironment__wrappee__base } true; 2828#L754 assume { :end_inline_processEnvironment__wrappee__base } true; 2829#L762-1 assume { :end_inline_processEnvironment } true; 2964#L737-1 assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret49#1, __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_~tmp~7#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification4_spec__1_~tmp~7#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; 2963#L700 __utac_acc__Specification4_spec__1_#t~ret49#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~7#1 := __utac_acc__Specification4_spec__1_#t~ret49#1;havoc __utac_acc__Specification4_spec__1_#t~ret49#1; 2961#L892 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~7#1); 2959#L892-1 assume { :end_inline___utac_acc__Specification4_spec__1 } true; 2958#L747 assume { :end_inline_timeShift } true; 2939#L565-2 [2022-02-21 04:17:53,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:17:53,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 5 times [2022-02-21 04:17:53,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:17:53,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482117783] [2022-02-21 04:17:53,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:17:53,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:17:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:53,217 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:17:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:53,234 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:17:53,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:17:53,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1161661781, now seen corresponding path program 1 times [2022-02-21 04:17:53,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:17:53,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192708900] [2022-02-21 04:17:53,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:17:53,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:17:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:53,244 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:17:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:53,248 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:17:53,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:17:53,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1882300775, now seen corresponding path program 1 times [2022-02-21 04:17:53,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:17:53,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237831991] [2022-02-21 04:17:53,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:17:53,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:17:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:53,277 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:17:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:53,287 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:17:55,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:17:55 BoogieIcfgContainer [2022-02-21 04:17:55,916 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:17:55,916 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:17:55,916 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:17:55,916 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:17:55,917 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:17:50" (3/4) ... [2022-02-21 04:17:55,918 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-02-21 04:17:55,989 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 04:17:55,989 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:17:55,990 INFO L158 Benchmark]: Toolchain (without parser) took 6154.96ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 65.7MB in the beginning and 87.6MB in the end (delta: -21.9MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. [2022-02-21 04:17:55,991 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory was 72.1MB in the beginning and 72.0MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:17:55,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.71ms. Allocated memory is still 100.7MB. Free memory was 65.6MB in the beginning and 65.4MB in the end (delta: 203.2kB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2022-02-21 04:17:55,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.26ms. Allocated memory is still 100.7MB. Free memory was 65.4MB in the beginning and 62.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:17:55,994 INFO L158 Benchmark]: Boogie Preprocessor took 44.34ms. Allocated memory is still 100.7MB. Free memory was 62.3MB in the beginning and 60.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:17:55,994 INFO L158 Benchmark]: RCFGBuilder took 507.49ms. Allocated memory is still 100.7MB. Free memory was 60.2MB in the beginning and 40.1MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-02-21 04:17:55,994 INFO L158 Benchmark]: BuchiAutomizer took 5067.28ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 39.6MB in the beginning and 90.7MB in the end (delta: -51.1MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2022-02-21 04:17:55,995 INFO L158 Benchmark]: Witness Printer took 73.35ms. Allocated memory is still 176.2MB. Free memory was 89.7MB in the beginning and 87.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:17:55,999 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory was 72.1MB in the beginning and 72.0MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.71ms. Allocated memory is still 100.7MB. Free memory was 65.6MB in the beginning and 65.4MB in the end (delta: 203.2kB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.26ms. Allocated memory is still 100.7MB. Free memory was 65.4MB in the beginning and 62.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.34ms. Allocated memory is still 100.7MB. Free memory was 62.3MB in the beginning and 60.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 507.49ms. Allocated memory is still 100.7MB. Free memory was 60.2MB in the beginning and 40.1MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 5067.28ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 39.6MB in the beginning and 90.7MB in the end (delta: -51.1MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * Witness Printer took 73.35ms. Allocated memory is still 176.2MB. Free memory was 89.7MB in the beginning and 87.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 159 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 442 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 159 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1146 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1146 mSDsluCounter, 1520 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 852 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 668 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 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: 565]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {splverifierCounter=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3925d31d=0, NULL=0, tmp___0=0, head=0, pumpRunning=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65c49408=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30727053=29, tmp___0=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d1c4512=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f5f90e3=0, retValue_acc=1, methaneLevelCritical=0, retValue_acc=0, tmp=1, retValue_acc=1, retValue_acc=0, \result=1, \result=1, retValue_acc=1, tmp=1, tmp___2=29, tmp=1, cleanupTimeShifts=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c17d534=0, \result=0, tmp=0, head=0, \result=1, tmp___1=0, NULL=0, waterLevel=1, systemActive=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@9a62dfc=0, tmp=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@463dfd94=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e022595=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 565]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L219] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L416] int cleanupTimeShifts = 4; [L625] int waterLevel = 1; [L626] int methaneLevelCritical = 0; [L722] int pumpRunning = 0; [L723] int systemActive = 1; [L497] int retValue_acc ; [L498] int tmp ; [L502] FCALL select_helpers() [L503] FCALL select_features() [L504] CALL, EXPR valid_product() [L546] int retValue_acc ; [L549] retValue_acc = 1 [L550] return (retValue_acc); [L504] RET, EXPR valid_product() [L504] tmp = valid_product() [L506] COND TRUE \read(tmp) [L508] FCALL setup() [L509] CALL runTest() [L488] CALL test() [L556] int splverifierCounter ; [L557] int tmp ; [L558] int tmp___0 ; [L559] int tmp___1 ; [L560] int tmp___2 ; [L563] splverifierCounter = 0 Loop: [L565] COND TRUE 1 [L567] COND TRUE splverifierCounter < 4 [L573] tmp = __VERIFIER_nondet_int() [L575] COND FALSE !(\read(tmp)) [L583] tmp___0 = __VERIFIER_nondet_int() [L585] COND FALSE !(\read(tmp___0)) [L593] tmp___2 = __VERIFIER_nondet_int() [L595] COND TRUE \read(tmp___2) [L608] CALL timeShift() [L730] COND FALSE !(\read(pumpRunning)) [L737] COND TRUE \read(systemActive) [L739] CALL processEnvironment() [L759] int tmp ; [L762] COND TRUE ! pumpRunning [L764] CALL, EXPR isHighWaterLevel() [L856] int retValue_acc ; [L857] int tmp ; [L858] int tmp___0 ; [L862] CALL, EXPR isHighWaterSensorDry() [L705] int retValue_acc ; [L708] COND TRUE waterLevel < 2 [L709] retValue_acc = 1 [L710] return (retValue_acc); [L862] RET, EXPR isHighWaterSensorDry() [L862] tmp = isHighWaterSensorDry() [L864] COND TRUE \read(tmp) [L865] tmp___0 = 0 [L869] retValue_acc = tmp___0 [L870] return (retValue_acc); [L764] RET, EXPR isHighWaterLevel() [L764] tmp = isHighWaterLevel() [L766] COND FALSE !(\read(tmp)) [L772] FCALL processEnvironment__wrappee__base() [L739] RET processEnvironment() [L745] CALL __utac_acc__Specification4_spec__1() [L885] int tmp ; [L886] int tmp___0 ; [L890] CALL, EXPR getWaterLevel() [L696] int retValue_acc ; [L699] retValue_acc = waterLevel [L700] return (retValue_acc); [L890] RET, EXPR getWaterLevel() [L890] tmp = getWaterLevel() [L892] COND FALSE !(tmp == 0) [L745] RET __utac_acc__Specification4_spec__1() [L608] RET timeShift() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-02-21 04:17:56,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)