./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_10.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/locks/test_locks_10.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 c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:39:06,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:39:06,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:39:06,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:39:06,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:39:06,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:39:06,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:39:06,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:39:06,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:39:06,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:39:06,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:39:06,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:39:06,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:39:06,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:39:06,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:39:06,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:39:06,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:39:06,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:39:06,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:39:06,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:39:06,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:39:06,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:39:06,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:39:06,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:39:06,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:39:06,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:39:06,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:39:06,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:39:06,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:39:06,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:39:06,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:39:06,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:39:06,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:39:06,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:39:06,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:39:06,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:39:06,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:39:06,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:39:06,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:39:06,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:39:06,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:39:06,240 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:39:06,266 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:39:06,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:39:06,267 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:39:06,267 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:39:06,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:39:06,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:39:06,268 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:39:06,269 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:39:06,269 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:39:06,269 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:39:06,270 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:39:06,270 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:39:06,270 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:39:06,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:39:06,270 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:39:06,270 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:39:06,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:39:06,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:39:06,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:39:06,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:39:06,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:39:06,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:39:06,271 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:39:06,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:39:06,272 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:39:06,273 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:39:06,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:39:06,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:39:06,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:39:06,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:39:06,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:39:06,275 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:39:06,275 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 -> c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b [2022-02-21 03:39:06,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:39:06,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:39:06,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:39:06,498 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:39:06,499 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:39:06,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_10.c [2022-02-21 03:39:06,550 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae75b4fae/e59dd2b5b3da42c7869f5443973a306a/FLAGa79e62c60 [2022-02-21 03:39:06,930 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:39:06,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2022-02-21 03:39:06,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae75b4fae/e59dd2b5b3da42c7869f5443973a306a/FLAGa79e62c60 [2022-02-21 03:39:06,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae75b4fae/e59dd2b5b3da42c7869f5443973a306a [2022-02-21 03:39:06,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:39:06,956 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:39:06,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:39:06,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:39:06,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:39:06,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:39:06" (1/1) ... [2022-02-21 03:39:06,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba0e294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:06, skipping insertion in model container [2022-02-21 03:39:06,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:39:06" (1/1) ... [2022-02-21 03:39:06,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:39:06,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:39:07,167 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/locks/test_locks_10.c[3901,3914] [2022-02-21 03:39:07,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:39:07,184 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:39:07,205 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/locks/test_locks_10.c[3901,3914] [2022-02-21 03:39:07,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:39:07,215 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:39:07,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:07 WrapperNode [2022-02-21 03:39:07,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:39:07,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:39:07,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:39:07,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:39:07,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:07" (1/1) ... [2022-02-21 03:39:07,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:07" (1/1) ... [2022-02-21 03:39:07,243 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2022-02-21 03:39:07,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:39:07,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:39:07,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:39:07,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:39:07,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:07" (1/1) ... [2022-02-21 03:39:07,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:07" (1/1) ... [2022-02-21 03:39:07,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:07" (1/1) ... [2022-02-21 03:39:07,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:07" (1/1) ... [2022-02-21 03:39:07,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:07" (1/1) ... [2022-02-21 03:39:07,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:07" (1/1) ... [2022-02-21 03:39:07,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:07" (1/1) ... [2022-02-21 03:39:07,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:39:07,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:39:07,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:39:07,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:39:07,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:07" (1/1) ... [2022-02-21 03:39:07,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:39:07,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:39:07,304 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 03:39:07,309 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 03:39:07,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:39:07,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:39:07,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:39:07,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:39:07,382 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:39:07,383 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:39:07,539 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:39:07,544 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:39:07,544 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:39:07,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:39:07 BoogieIcfgContainer [2022-02-21 03:39:07,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:39:07,546 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:39:07,546 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:39:07,549 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:39:07,550 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:07,550 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:39:06" (1/3) ... [2022-02-21 03:39:07,551 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dc16f16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:39:07, skipping insertion in model container [2022-02-21 03:39:07,551 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:07,551 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:07" (2/3) ... [2022-02-21 03:39:07,551 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dc16f16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:39:07, skipping insertion in model container [2022-02-21 03:39:07,551 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:07,551 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:39:07" (3/3) ... [2022-02-21 03:39:07,552 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_10.c [2022-02-21 03:39:07,584 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:39:07,584 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:39:07,585 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:39:07,585 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:39:07,585 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:39:07,585 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:39:07,585 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:39:07,585 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:39:07,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 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 03:39:07,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-02-21 03:39:07,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:07,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:07,651 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:07,651 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] [2022-02-21 03:39:07,651 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:39:07,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 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 03:39:07,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-02-21 03:39:07,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:07,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:07,660 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:07,660 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] [2022-02-21 03:39:07,665 INFO L791 eck$LassoCheckResult]: Stem: 24#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(16, 2);call #Ultimate.allocInit(12, 3); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 30#L155-1true [2022-02-21 03:39:07,667 INFO L793 eck$LassoCheckResult]: Loop: 30#L155-1true assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 27#L43true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 31#L68true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 10#L68-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 4#L72-1true assume !(0 != main_~p3~0#1); 19#L76-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 18#L80-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 32#L84-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 20#L88-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 7#L92-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 5#L96-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8#L100-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 39#L104-1true assume !(0 != main_~p1~0#1); 25#L110-1true assume !(0 != main_~p2~0#1); 34#L115-1true assume !(0 != main_~p3~0#1); 17#L120-1true assume !(0 != main_~p4~0#1); 29#L125-1true assume !(0 != main_~p5~0#1); 36#L130-1true assume !(0 != main_~p6~0#1); 16#L135-1true assume !(0 != main_~p7~0#1); 14#L140-1true assume !(0 != main_~p8~0#1); 40#L145-1true assume !(0 != main_~p9~0#1); 11#L150-1true assume !(0 != main_~p10~0#1); 30#L155-1true [2022-02-21 03:39:07,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:07,674 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:39:07,686 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:07,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630927269] [2022-02-21 03:39:07,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:07,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:07,746 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:07,780 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:07,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:07,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1693159719, now seen corresponding path program 1 times [2022-02-21 03:39:07,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:07,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264471531] [2022-02-21 03:39:07,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:07,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:07,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#true} assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {45#true} is VALID [2022-02-21 03:39:07,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; {45#true} is VALID [2022-02-21 03:39:07,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,886 INFO L290 TraceCheckUtils]: 4: Hoare triple {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {47#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {46#false} is VALID [2022-02-21 03:39:07,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {46#false} assume !(0 != main_~p2~0#1); {46#false} is VALID [2022-02-21 03:39:07,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {46#false} assume !(0 != main_~p3~0#1); {46#false} is VALID [2022-02-21 03:39:07,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {46#false} assume !(0 != main_~p4~0#1); {46#false} is VALID [2022-02-21 03:39:07,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {46#false} assume !(0 != main_~p5~0#1); {46#false} is VALID [2022-02-21 03:39:07,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {46#false} assume !(0 != main_~p6~0#1); {46#false} is VALID [2022-02-21 03:39:07,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {46#false} assume !(0 != main_~p7~0#1); {46#false} is VALID [2022-02-21 03:39:07,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {46#false} assume !(0 != main_~p8~0#1); {46#false} is VALID [2022-02-21 03:39:07,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {46#false} assume !(0 != main_~p9~0#1); {46#false} is VALID [2022-02-21 03:39:07,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {46#false} assume !(0 != main_~p10~0#1); {46#false} is VALID [2022-02-21 03:39:07,897 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 03:39:07,897 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:07,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264471531] [2022-02-21 03:39:07,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264471531] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:07,898 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:07,898 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:07,898 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351229345] [2022-02-21 03:39:07,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:07,903 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:07,904 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:07,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:07,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:07,929 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 03:39:08,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,078 INFO L93 Difference]: Finished difference Result 75 states and 130 transitions. [2022-02-21 03:39:08,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:08,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 03:39:08,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:08,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 130 transitions. [2022-02-21 03:39:08,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2022-02-21 03:39:08,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 65 states and 103 transitions. [2022-02-21 03:39:08,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2022-02-21 03:39:08,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2022-02-21 03:39:08,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 103 transitions. [2022-02-21 03:39:08,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:08,132 INFO L681 BuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2022-02-21 03:39:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 103 transitions. [2022-02-21 03:39:08,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-02-21 03:39:08,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:08,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states and 103 transitions. Second operand has 65 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 64 states have internal predecessors, (103), 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 03:39:08,153 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states and 103 transitions. Second operand has 65 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 64 states have internal predecessors, (103), 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 03:39:08,154 INFO L87 Difference]: Start difference. First operand 65 states and 103 transitions. Second operand has 65 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 64 states have internal predecessors, (103), 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 03:39:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,157 INFO L93 Difference]: Finished difference Result 65 states and 103 transitions. [2022-02-21 03:39:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 103 transitions. [2022-02-21 03:39:08,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:08,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:08,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 64 states have internal predecessors, (103), 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 65 states and 103 transitions. [2022-02-21 03:39:08,159 INFO L87 Difference]: Start difference. First operand has 65 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 64 states have internal predecessors, (103), 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 65 states and 103 transitions. [2022-02-21 03:39:08,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,162 INFO L93 Difference]: Finished difference Result 65 states and 103 transitions. [2022-02-21 03:39:08,162 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 103 transitions. [2022-02-21 03:39:08,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:08,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:08,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:08,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 64 states have internal predecessors, (103), 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 03:39:08,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 103 transitions. [2022-02-21 03:39:08,166 INFO L704 BuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2022-02-21 03:39:08,166 INFO L587 BuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2022-02-21 03:39:08,166 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:39:08,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 103 transitions. [2022-02-21 03:39:08,167 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2022-02-21 03:39:08,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:08,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:08,168 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:08,168 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] [2022-02-21 03:39:08,168 INFO L791 eck$LassoCheckResult]: Stem: 150#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(16, 2);call #Ultimate.allocInit(12, 3); 132#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 133#L155-1 [2022-02-21 03:39:08,169 INFO L793 eck$LassoCheckResult]: Loop: 133#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 154#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 155#L68 assume !(0 != main_~p1~0#1); 134#L68-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 123#L72-1 assume !(0 != main_~p3~0#1); 124#L76-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 145#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 146#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 167#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 166#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 125#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 126#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 131#L104-1 assume !(0 != main_~p1~0#1); 151#L110-1 assume !(0 != main_~p2~0#1); 152#L115-1 assume !(0 != main_~p3~0#1); 144#L120-1 assume !(0 != main_~p4~0#1); 128#L125-1 assume !(0 != main_~p5~0#1); 138#L130-1 assume !(0 != main_~p6~0#1); 143#L135-1 assume !(0 != main_~p7~0#1); 139#L140-1 assume !(0 != main_~p8~0#1); 140#L145-1 assume !(0 != main_~p9~0#1); 135#L150-1 assume !(0 != main_~p10~0#1); 133#L155-1 [2022-02-21 03:39:08,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:08,169 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:39:08,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:08,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059167869] [2022-02-21 03:39:08,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:08,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:08,176 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:08,181 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:08,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:08,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1784159127, now seen corresponding path program 1 times [2022-02-21 03:39:08,181 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:08,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302708540] [2022-02-21 03:39:08,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:08,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:08,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {323#true} assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {323#true} is VALID [2022-02-21 03:39:08,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; {323#true} is VALID [2022-02-21 03:39:08,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {323#true} assume !(0 != main_~p1~0#1); {323#true} is VALID [2022-02-21 03:39:08,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {323#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:08,211 INFO L290 TraceCheckUtils]: 4: Hoare triple {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:08,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:08,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:08,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:08,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:08,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:08,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:08,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:08,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:08,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {325#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {324#false} is VALID [2022-02-21 03:39:08,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {324#false} assume !(0 != main_~p3~0#1); {324#false} is VALID [2022-02-21 03:39:08,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#false} assume !(0 != main_~p4~0#1); {324#false} is VALID [2022-02-21 03:39:08,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {324#false} assume !(0 != main_~p5~0#1); {324#false} is VALID [2022-02-21 03:39:08,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {324#false} assume !(0 != main_~p6~0#1); {324#false} is VALID [2022-02-21 03:39:08,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {324#false} assume !(0 != main_~p7~0#1); {324#false} is VALID [2022-02-21 03:39:08,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {324#false} assume !(0 != main_~p8~0#1); {324#false} is VALID [2022-02-21 03:39:08,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {324#false} assume !(0 != main_~p9~0#1); {324#false} is VALID [2022-02-21 03:39:08,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {324#false} assume !(0 != main_~p10~0#1); {324#false} is VALID [2022-02-21 03:39:08,216 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 03:39:08,216 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:08,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302708540] [2022-02-21 03:39:08,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302708540] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:08,217 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:08,217 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:08,217 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312380447] [2022-02-21 03:39:08,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:08,218 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:08,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:08,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:08,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:08,220 INFO L87 Difference]: Start difference. First operand 65 states and 103 transitions. cyclomatic complexity: 40 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 03:39:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,316 INFO L93 Difference]: Finished difference Result 126 states and 198 transitions. [2022-02-21 03:39:08,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:08,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 03:39:08,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:08,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 198 transitions. [2022-02-21 03:39:08,351 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2022-02-21 03:39:08,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 198 transitions. [2022-02-21 03:39:08,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2022-02-21 03:39:08,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2022-02-21 03:39:08,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 198 transitions. [2022-02-21 03:39:08,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:08,356 INFO L681 BuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2022-02-21 03:39:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 198 transitions. [2022-02-21 03:39:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-02-21 03:39:08,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:08,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states and 198 transitions. Second operand has 126 states, 126 states have (on average 1.5714285714285714) internal successors, (198), 125 states have internal predecessors, (198), 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 03:39:08,363 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states and 198 transitions. Second operand has 126 states, 126 states have (on average 1.5714285714285714) internal successors, (198), 125 states have internal predecessors, (198), 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 03:39:08,364 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand has 126 states, 126 states have (on average 1.5714285714285714) internal successors, (198), 125 states have internal predecessors, (198), 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 03:39:08,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,372 INFO L93 Difference]: Finished difference Result 126 states and 198 transitions. [2022-02-21 03:39:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2022-02-21 03:39:08,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:08,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:08,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 126 states have (on average 1.5714285714285714) internal successors, (198), 125 states have internal predecessors, (198), 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 126 states and 198 transitions. [2022-02-21 03:39:08,374 INFO L87 Difference]: Start difference. First operand has 126 states, 126 states have (on average 1.5714285714285714) internal successors, (198), 125 states have internal predecessors, (198), 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 126 states and 198 transitions. [2022-02-21 03:39:08,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,384 INFO L93 Difference]: Finished difference Result 126 states and 198 transitions. [2022-02-21 03:39:08,385 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2022-02-21 03:39:08,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:08,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:08,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:08,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:08,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.5714285714285714) internal successors, (198), 125 states have internal predecessors, (198), 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 03:39:08,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2022-02-21 03:39:08,404 INFO L704 BuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2022-02-21 03:39:08,404 INFO L587 BuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2022-02-21 03:39:08,404 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:39:08,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 198 transitions. [2022-02-21 03:39:08,405 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2022-02-21 03:39:08,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:08,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:08,406 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:08,406 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] [2022-02-21 03:39:08,406 INFO L791 eck$LassoCheckResult]: Stem: 480#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(16, 2);call #Ultimate.allocInit(12, 3); 460#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 461#L155-1 [2022-02-21 03:39:08,406 INFO L793 eck$LassoCheckResult]: Loop: 461#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 510#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 508#L68 assume !(0 != main_~p1~0#1); 506#L68-2 assume !(0 != main_~p2~0#1); 505#L72-1 assume !(0 != main_~p3~0#1); 504#L76-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 503#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 502#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 501#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 500#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 499#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 498#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 496#L104-1 assume !(0 != main_~p1~0#1); 497#L110-1 assume !(0 != main_~p2~0#1); 526#L115-1 assume !(0 != main_~p3~0#1); 524#L120-1 assume !(0 != main_~p4~0#1); 522#L125-1 assume !(0 != main_~p5~0#1); 520#L130-1 assume !(0 != main_~p6~0#1); 518#L135-1 assume !(0 != main_~p7~0#1); 516#L140-1 assume !(0 != main_~p8~0#1); 514#L145-1 assume !(0 != main_~p9~0#1); 512#L150-1 assume !(0 != main_~p10~0#1); 461#L155-1 [2022-02-21 03:39:08,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:08,407 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-02-21 03:39:08,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:08,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841887652] [2022-02-21 03:39:08,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:08,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:08,413 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:08,417 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:08,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:08,418 INFO L85 PathProgramCache]: Analyzing trace with hash 95215385, now seen corresponding path program 1 times [2022-02-21 03:39:08,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:08,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688490925] [2022-02-21 03:39:08,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:08,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:08,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {835#true} assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {835#true} is VALID [2022-02-21 03:39:08,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; {835#true} is VALID [2022-02-21 03:39:08,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {835#true} assume !(0 != main_~p1~0#1); {835#true} is VALID [2022-02-21 03:39:08,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {835#true} assume !(0 != main_~p2~0#1); {835#true} is VALID [2022-02-21 03:39:08,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {835#true} assume !(0 != main_~p3~0#1); {835#true} is VALID [2022-02-21 03:39:08,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {835#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {837#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {836#false} is VALID [2022-02-21 03:39:08,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {836#false} assume !(0 != main_~p5~0#1); {836#false} is VALID [2022-02-21 03:39:08,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {836#false} assume !(0 != main_~p6~0#1); {836#false} is VALID [2022-02-21 03:39:08,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {836#false} assume !(0 != main_~p7~0#1); {836#false} is VALID [2022-02-21 03:39:08,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {836#false} assume !(0 != main_~p8~0#1); {836#false} is VALID [2022-02-21 03:39:08,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {836#false} assume !(0 != main_~p9~0#1); {836#false} is VALID [2022-02-21 03:39:08,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {836#false} assume !(0 != main_~p10~0#1); {836#false} is VALID [2022-02-21 03:39:08,445 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 03:39:08,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:08,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688490925] [2022-02-21 03:39:08,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688490925] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:08,446 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:08,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:08,446 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994795731] [2022-02-21 03:39:08,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:08,446 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:08,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:08,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:08,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:08,447 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. cyclomatic complexity: 76 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 03:39:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,508 INFO L93 Difference]: Finished difference Result 246 states and 382 transitions. [2022-02-21 03:39:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:08,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 03:39:08,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:08,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 382 transitions. [2022-02-21 03:39:08,530 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2022-02-21 03:39:08,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 246 states and 382 transitions. [2022-02-21 03:39:08,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 246 [2022-02-21 03:39:08,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246 [2022-02-21 03:39:08,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 382 transitions. [2022-02-21 03:39:08,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:08,538 INFO L681 BuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2022-02-21 03:39:08,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 382 transitions. [2022-02-21 03:39:08,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-02-21 03:39:08,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:08,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states and 382 transitions. Second operand has 246 states, 246 states have (on average 1.5528455284552845) internal successors, (382), 245 states have internal predecessors, (382), 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 03:39:08,547 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states and 382 transitions. Second operand has 246 states, 246 states have (on average 1.5528455284552845) internal successors, (382), 245 states have internal predecessors, (382), 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 03:39:08,548 INFO L87 Difference]: Start difference. First operand 246 states and 382 transitions. Second operand has 246 states, 246 states have (on average 1.5528455284552845) internal successors, (382), 245 states have internal predecessors, (382), 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 03:39:08,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,568 INFO L93 Difference]: Finished difference Result 246 states and 382 transitions. [2022-02-21 03:39:08,569 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 382 transitions. [2022-02-21 03:39:08,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:08,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:08,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 246 states have (on average 1.5528455284552845) internal successors, (382), 245 states have internal predecessors, (382), 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 246 states and 382 transitions. [2022-02-21 03:39:08,571 INFO L87 Difference]: Start difference. First operand has 246 states, 246 states have (on average 1.5528455284552845) internal successors, (382), 245 states have internal predecessors, (382), 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 246 states and 382 transitions. [2022-02-21 03:39:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,577 INFO L93 Difference]: Finished difference Result 246 states and 382 transitions. [2022-02-21 03:39:08,577 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 382 transitions. [2022-02-21 03:39:08,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:08,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:08,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:08,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:08,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 246 states have (on average 1.5528455284552845) internal successors, (382), 245 states have internal predecessors, (382), 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 03:39:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 382 transitions. [2022-02-21 03:39:08,583 INFO L704 BuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2022-02-21 03:39:08,583 INFO L587 BuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2022-02-21 03:39:08,583 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:39:08,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 382 transitions. [2022-02-21 03:39:08,585 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2022-02-21 03:39:08,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:08,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:08,585 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:08,585 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] [2022-02-21 03:39:08,585 INFO L791 eck$LassoCheckResult]: Stem: 1115#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(16, 2);call #Ultimate.allocInit(12, 3); 1093#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 1094#L155-1 [2022-02-21 03:39:08,586 INFO L793 eck$LassoCheckResult]: Loop: 1094#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 1166#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 1163#L68 assume !(0 != main_~p1~0#1); 1159#L68-2 assume !(0 != main_~p2~0#1); 1156#L72-1 assume !(0 != main_~p3~0#1); 1153#L76-1 assume !(0 != main_~p4~0#1); 1154#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1148#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1149#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1144#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1145#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1140#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1141#L104-1 assume !(0 != main_~p1~0#1); 1197#L110-1 assume !(0 != main_~p2~0#1); 1195#L115-1 assume !(0 != main_~p3~0#1); 1192#L120-1 assume !(0 != main_~p4~0#1); 1189#L125-1 assume !(0 != main_~p5~0#1); 1185#L130-1 assume !(0 != main_~p6~0#1); 1181#L135-1 assume !(0 != main_~p7~0#1); 1177#L140-1 assume !(0 != main_~p8~0#1); 1173#L145-1 assume !(0 != main_~p9~0#1); 1171#L150-1 assume !(0 != main_~p10~0#1); 1094#L155-1 [2022-02-21 03:39:08,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:08,586 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-02-21 03:39:08,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:08,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721102861] [2022-02-21 03:39:08,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:08,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:08,606 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:08,615 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:08,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1493132517, now seen corresponding path program 1 times [2022-02-21 03:39:08,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:08,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477853064] [2022-02-21 03:39:08,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:08,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:08,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {1827#true} assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {1827#true} is VALID [2022-02-21 03:39:08,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; {1827#true} is VALID [2022-02-21 03:39:08,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume !(0 != main_~p1~0#1); {1827#true} is VALID [2022-02-21 03:39:08,647 INFO L290 TraceCheckUtils]: 3: Hoare triple {1827#true} assume !(0 != main_~p2~0#1); {1827#true} is VALID [2022-02-21 03:39:08,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {1827#true} assume !(0 != main_~p3~0#1); {1827#true} is VALID [2022-02-21 03:39:08,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {1827#true} assume !(0 != main_~p4~0#1); {1827#true} is VALID [2022-02-21 03:39:08,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {1827#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {1829#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {1828#false} is VALID [2022-02-21 03:39:08,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {1828#false} assume !(0 != main_~p6~0#1); {1828#false} is VALID [2022-02-21 03:39:08,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {1828#false} assume !(0 != main_~p7~0#1); {1828#false} is VALID [2022-02-21 03:39:08,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {1828#false} assume !(0 != main_~p8~0#1); {1828#false} is VALID [2022-02-21 03:39:08,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {1828#false} assume !(0 != main_~p9~0#1); {1828#false} is VALID [2022-02-21 03:39:08,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {1828#false} assume !(0 != main_~p10~0#1); {1828#false} is VALID [2022-02-21 03:39:08,654 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 03:39:08,654 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:08,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477853064] [2022-02-21 03:39:08,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477853064] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:08,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:08,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:08,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376212726] [2022-02-21 03:39:08,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:08,655 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:08,655 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:08,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:08,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:08,656 INFO L87 Difference]: Start difference. First operand 246 states and 382 transitions. cyclomatic complexity: 144 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 03:39:08,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,724 INFO L93 Difference]: Finished difference Result 482 states and 738 transitions. [2022-02-21 03:39:08,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:08,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 03:39:08,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:08,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 738 transitions. [2022-02-21 03:39:08,751 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2022-02-21 03:39:08,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 482 states and 738 transitions. [2022-02-21 03:39:08,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2022-02-21 03:39:08,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2022-02-21 03:39:08,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 482 states and 738 transitions. [2022-02-21 03:39:08,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:08,764 INFO L681 BuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2022-02-21 03:39:08,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states and 738 transitions. [2022-02-21 03:39:08,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2022-02-21 03:39:08,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:08,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 482 states and 738 transitions. Second operand has 482 states, 482 states have (on average 1.5311203319502074) internal successors, (738), 481 states have internal predecessors, (738), 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 03:39:08,777 INFO L74 IsIncluded]: Start isIncluded. First operand 482 states and 738 transitions. Second operand has 482 states, 482 states have (on average 1.5311203319502074) internal successors, (738), 481 states have internal predecessors, (738), 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 03:39:08,778 INFO L87 Difference]: Start difference. First operand 482 states and 738 transitions. Second operand has 482 states, 482 states have (on average 1.5311203319502074) internal successors, (738), 481 states have internal predecessors, (738), 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 03:39:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,813 INFO L93 Difference]: Finished difference Result 482 states and 738 transitions. [2022-02-21 03:39:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 738 transitions. [2022-02-21 03:39:08,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:08,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:08,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 482 states, 482 states have (on average 1.5311203319502074) internal successors, (738), 481 states have internal predecessors, (738), 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 482 states and 738 transitions. [2022-02-21 03:39:08,816 INFO L87 Difference]: Start difference. First operand has 482 states, 482 states have (on average 1.5311203319502074) internal successors, (738), 481 states have internal predecessors, (738), 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 482 states and 738 transitions. [2022-02-21 03:39:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,827 INFO L93 Difference]: Finished difference Result 482 states and 738 transitions. [2022-02-21 03:39:08,827 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 738 transitions. [2022-02-21 03:39:08,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:08,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:08,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:08,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 482 states have (on average 1.5311203319502074) internal successors, (738), 481 states have internal predecessors, (738), 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 03:39:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 738 transitions. [2022-02-21 03:39:08,839 INFO L704 BuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2022-02-21 03:39:08,839 INFO L587 BuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2022-02-21 03:39:08,840 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:39:08,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 738 transitions. [2022-02-21 03:39:08,841 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2022-02-21 03:39:08,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:08,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:08,842 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:08,842 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] [2022-02-21 03:39:08,842 INFO L791 eck$LassoCheckResult]: Stem: 2341#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(16, 2);call #Ultimate.allocInit(12, 3); 2320#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 2321#L155-1 [2022-02-21 03:39:08,842 INFO L793 eck$LassoCheckResult]: Loop: 2321#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 2388#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 2385#L68 assume !(0 != main_~p1~0#1); 2381#L68-2 assume !(0 != main_~p2~0#1); 2378#L72-1 assume !(0 != main_~p3~0#1); 2375#L76-1 assume !(0 != main_~p4~0#1); 2376#L80-1 assume !(0 != main_~p5~0#1); 2439#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 2436#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2433#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2430#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2428#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2425#L104-1 assume !(0 != main_~p1~0#1); 2421#L110-1 assume !(0 != main_~p2~0#1); 2418#L115-1 assume !(0 != main_~p3~0#1); 2414#L120-1 assume !(0 != main_~p4~0#1); 2411#L125-1 assume !(0 != main_~p5~0#1); 2409#L130-1 assume !(0 != main_~p6~0#1); 2405#L135-1 assume !(0 != main_~p7~0#1); 2401#L140-1 assume !(0 != main_~p8~0#1); 2397#L145-1 assume !(0 != main_~p9~0#1); 2393#L150-1 assume !(0 != main_~p10~0#1); 2321#L155-1 [2022-02-21 03:39:08,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:08,843 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-02-21 03:39:08,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:08,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828367632] [2022-02-21 03:39:08,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:08,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:08,848 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:08,852 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:08,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:08,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1780766425, now seen corresponding path program 1 times [2022-02-21 03:39:08,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:08,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085245120] [2022-02-21 03:39:08,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:08,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:08,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {3763#true} assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {3763#true} is VALID [2022-02-21 03:39:08,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {3763#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; {3763#true} is VALID [2022-02-21 03:39:08,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {3763#true} assume !(0 != main_~p1~0#1); {3763#true} is VALID [2022-02-21 03:39:08,878 INFO L290 TraceCheckUtils]: 3: Hoare triple {3763#true} assume !(0 != main_~p2~0#1); {3763#true} is VALID [2022-02-21 03:39:08,878 INFO L290 TraceCheckUtils]: 4: Hoare triple {3763#true} assume !(0 != main_~p3~0#1); {3763#true} is VALID [2022-02-21 03:39:08,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {3763#true} assume !(0 != main_~p4~0#1); {3763#true} is VALID [2022-02-21 03:39:08,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {3763#true} assume !(0 != main_~p5~0#1); {3763#true} is VALID [2022-02-21 03:39:08,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {3763#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p2~0#1); {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {3765#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {3764#false} is VALID [2022-02-21 03:39:08,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {3764#false} assume !(0 != main_~p7~0#1); {3764#false} is VALID [2022-02-21 03:39:08,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {3764#false} assume !(0 != main_~p8~0#1); {3764#false} is VALID [2022-02-21 03:39:08,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {3764#false} assume !(0 != main_~p9~0#1); {3764#false} is VALID [2022-02-21 03:39:08,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {3764#false} assume !(0 != main_~p10~0#1); {3764#false} is VALID [2022-02-21 03:39:08,888 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 03:39:08,888 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:08,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085245120] [2022-02-21 03:39:08,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085245120] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:08,888 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:08,888 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:08,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479547403] [2022-02-21 03:39:08,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:08,889 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:08,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:08,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:08,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:08,894 INFO L87 Difference]: Start difference. First operand 482 states and 738 transitions. cyclomatic complexity: 272 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 03:39:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:09,029 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2022-02-21 03:39:09,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:09,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 03:39:09,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:09,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 946 states and 1426 transitions. [2022-02-21 03:39:09,090 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2022-02-21 03:39:09,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 946 states to 946 states and 1426 transitions. [2022-02-21 03:39:09,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 946 [2022-02-21 03:39:09,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 946 [2022-02-21 03:39:09,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 946 states and 1426 transitions. [2022-02-21 03:39:09,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:09,129 INFO L681 BuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2022-02-21 03:39:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states and 1426 transitions. [2022-02-21 03:39:09,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2022-02-21 03:39:09,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:09,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 946 states and 1426 transitions. Second operand has 946 states, 946 states have (on average 1.507399577167019) internal successors, (1426), 945 states have internal predecessors, (1426), 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 03:39:09,142 INFO L74 IsIncluded]: Start isIncluded. First operand 946 states and 1426 transitions. Second operand has 946 states, 946 states have (on average 1.507399577167019) internal successors, (1426), 945 states have internal predecessors, (1426), 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 03:39:09,143 INFO L87 Difference]: Start difference. First operand 946 states and 1426 transitions. Second operand has 946 states, 946 states have (on average 1.507399577167019) internal successors, (1426), 945 states have internal predecessors, (1426), 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 03:39:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:09,167 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2022-02-21 03:39:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1426 transitions. [2022-02-21 03:39:09,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:09,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:09,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 946 states, 946 states have (on average 1.507399577167019) internal successors, (1426), 945 states have internal predecessors, (1426), 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 946 states and 1426 transitions. [2022-02-21 03:39:09,172 INFO L87 Difference]: Start difference. First operand has 946 states, 946 states have (on average 1.507399577167019) internal successors, (1426), 945 states have internal predecessors, (1426), 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 946 states and 1426 transitions. [2022-02-21 03:39:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:09,196 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2022-02-21 03:39:09,196 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1426 transitions. [2022-02-21 03:39:09,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:09,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:09,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:09,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 946 states have (on average 1.507399577167019) internal successors, (1426), 945 states have internal predecessors, (1426), 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 03:39:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1426 transitions. [2022-02-21 03:39:09,222 INFO L704 BuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2022-02-21 03:39:09,222 INFO L587 BuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2022-02-21 03:39:09,222 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:39:09,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 946 states and 1426 transitions. [2022-02-21 03:39:09,225 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2022-02-21 03:39:09,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:09,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:09,226 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:09,226 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] [2022-02-21 03:39:09,226 INFO L791 eck$LassoCheckResult]: Stem: 4740#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(16, 2);call #Ultimate.allocInit(12, 3); 4720#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 4721#L155-1 [2022-02-21 03:39:09,226 INFO L793 eck$LassoCheckResult]: Loop: 4721#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 4787#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 4788#L68 assume !(0 != main_~p1~0#1); 4879#L68-2 assume !(0 != main_~p2~0#1); 4875#L72-1 assume !(0 != main_~p3~0#1); 4869#L76-1 assume !(0 != main_~p4~0#1); 4870#L80-1 assume !(0 != main_~p5~0#1); 4891#L84-1 assume !(0 != main_~p6~0#1); 4887#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 4884#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4878#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4874#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4867#L104-1 assume !(0 != main_~p1~0#1); 4840#L110-1 assume !(0 != main_~p2~0#1); 4837#L115-1 assume !(0 != main_~p3~0#1); 4832#L120-1 assume !(0 != main_~p4~0#1); 4828#L125-1 assume !(0 != main_~p5~0#1); 4826#L130-1 assume !(0 != main_~p6~0#1); 4811#L135-1 assume !(0 != main_~p7~0#1); 4806#L140-1 assume !(0 != main_~p8~0#1); 4805#L145-1 assume !(0 != main_~p9~0#1); 4795#L150-1 assume !(0 != main_~p10~0#1); 4721#L155-1 [2022-02-21 03:39:09,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:09,227 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-02-21 03:39:09,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:09,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254256739] [2022-02-21 03:39:09,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:09,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:09,232 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:09,236 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:09,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:09,236 INFO L85 PathProgramCache]: Analyzing trace with hash 500902747, now seen corresponding path program 1 times [2022-02-21 03:39:09,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:09,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739590341] [2022-02-21 03:39:09,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:09,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:09,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {7555#true} assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {7555#true} is VALID [2022-02-21 03:39:09,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {7555#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; {7555#true} is VALID [2022-02-21 03:39:09,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {7555#true} assume !(0 != main_~p1~0#1); {7555#true} is VALID [2022-02-21 03:39:09,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {7555#true} assume !(0 != main_~p2~0#1); {7555#true} is VALID [2022-02-21 03:39:09,254 INFO L290 TraceCheckUtils]: 4: Hoare triple {7555#true} assume !(0 != main_~p3~0#1); {7555#true} is VALID [2022-02-21 03:39:09,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {7555#true} assume !(0 != main_~p4~0#1); {7555#true} is VALID [2022-02-21 03:39:09,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {7555#true} assume !(0 != main_~p5~0#1); {7555#true} is VALID [2022-02-21 03:39:09,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {7555#true} assume !(0 != main_~p6~0#1); {7555#true} is VALID [2022-02-21 03:39:09,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {7555#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:09,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:09,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:09,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:09,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p1~0#1); {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:09,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p2~0#1); {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:09,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p3~0#1); {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:09,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p4~0#1); {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:09,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p5~0#1); {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:09,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p6~0#1); {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:09,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {7557#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p7~0#1); {7556#false} is VALID [2022-02-21 03:39:09,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {7556#false} assume !(0 != main_~p8~0#1); {7556#false} is VALID [2022-02-21 03:39:09,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {7556#false} assume !(0 != main_~p9~0#1); {7556#false} is VALID [2022-02-21 03:39:09,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {7556#false} assume !(0 != main_~p10~0#1); {7556#false} is VALID [2022-02-21 03:39:09,259 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 03:39:09,259 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:09,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739590341] [2022-02-21 03:39:09,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739590341] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:09,259 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:09,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:09,260 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664317175] [2022-02-21 03:39:09,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:09,260 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:09,260 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:09,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:09,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:09,261 INFO L87 Difference]: Start difference. First operand 946 states and 1426 transitions. cyclomatic complexity: 512 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 03:39:09,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:09,385 INFO L93 Difference]: Finished difference Result 1858 states and 2754 transitions. [2022-02-21 03:39:09,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:09,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 03:39:09,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:09,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1858 states and 2754 transitions. [2022-02-21 03:39:09,482 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2022-02-21 03:39:09,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1858 states to 1858 states and 2754 transitions. [2022-02-21 03:39:09,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1858 [2022-02-21 03:39:09,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1858 [2022-02-21 03:39:09,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1858 states and 2754 transitions. [2022-02-21 03:39:09,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:09,586 INFO L681 BuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2022-02-21 03:39:09,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states and 2754 transitions. [2022-02-21 03:39:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2022-02-21 03:39:09,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:09,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1858 states and 2754 transitions. Second operand has 1858 states, 1858 states have (on average 1.4822389666307858) internal successors, (2754), 1857 states have internal predecessors, (2754), 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 03:39:09,612 INFO L74 IsIncluded]: Start isIncluded. First operand 1858 states and 2754 transitions. Second operand has 1858 states, 1858 states have (on average 1.4822389666307858) internal successors, (2754), 1857 states have internal predecessors, (2754), 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 03:39:09,615 INFO L87 Difference]: Start difference. First operand 1858 states and 2754 transitions. Second operand has 1858 states, 1858 states have (on average 1.4822389666307858) internal successors, (2754), 1857 states have internal predecessors, (2754), 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 03:39:09,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:09,702 INFO L93 Difference]: Finished difference Result 1858 states and 2754 transitions. [2022-02-21 03:39:09,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2754 transitions. [2022-02-21 03:39:09,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:09,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:09,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 1858 states, 1858 states have (on average 1.4822389666307858) internal successors, (2754), 1857 states have internal predecessors, (2754), 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 1858 states and 2754 transitions. [2022-02-21 03:39:09,715 INFO L87 Difference]: Start difference. First operand has 1858 states, 1858 states have (on average 1.4822389666307858) internal successors, (2754), 1857 states have internal predecessors, (2754), 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 1858 states and 2754 transitions. [2022-02-21 03:39:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:09,794 INFO L93 Difference]: Finished difference Result 1858 states and 2754 transitions. [2022-02-21 03:39:09,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2754 transitions. [2022-02-21 03:39:09,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:09,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:09,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:09,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1858 states have (on average 1.4822389666307858) internal successors, (2754), 1857 states have internal predecessors, (2754), 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 03:39:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2754 transitions. [2022-02-21 03:39:09,876 INFO L704 BuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2022-02-21 03:39:09,876 INFO L587 BuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2022-02-21 03:39:09,876 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:39:09,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1858 states and 2754 transitions. [2022-02-21 03:39:09,884 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2022-02-21 03:39:09,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:09,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:09,885 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:09,885 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] [2022-02-21 03:39:09,885 INFO L791 eck$LassoCheckResult]: Stem: 9448#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(16, 2);call #Ultimate.allocInit(12, 3); 9425#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 9426#L155-1 [2022-02-21 03:39:09,885 INFO L793 eck$LassoCheckResult]: Loop: 9426#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 9623#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 9620#L68 assume !(0 != main_~p1~0#1); 9616#L68-2 assume !(0 != main_~p2~0#1); 9613#L72-1 assume !(0 != main_~p3~0#1); 9611#L76-1 assume !(0 != main_~p4~0#1); 9601#L80-1 assume !(0 != main_~p5~0#1); 9603#L84-1 assume !(0 != main_~p6~0#1); 9588#L88-1 assume !(0 != main_~p7~0#1); 9590#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 9576#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 9577#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 9563#L104-1 assume !(0 != main_~p1~0#1); 9564#L110-1 assume !(0 != main_~p2~0#1); 9542#L115-1 assume !(0 != main_~p3~0#1); 9541#L120-1 assume !(0 != main_~p4~0#1); 9641#L125-1 assume !(0 != main_~p5~0#1); 9639#L130-1 assume !(0 != main_~p6~0#1); 9637#L135-1 assume !(0 != main_~p7~0#1); 9634#L140-1 assume !(0 != main_~p8~0#1); 9632#L145-1 assume !(0 != main_~p9~0#1); 9628#L150-1 assume !(0 != main_~p10~0#1); 9426#L155-1 [2022-02-21 03:39:09,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:09,886 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-02-21 03:39:09,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:09,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491409158] [2022-02-21 03:39:09,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:09,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:09,893 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:09,908 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:09,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:09,910 INFO L85 PathProgramCache]: Analyzing trace with hash -510214503, now seen corresponding path program 1 times [2022-02-21 03:39:09,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:09,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198586236] [2022-02-21 03:39:09,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:09,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:09,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {14995#true} assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {14995#true} is VALID [2022-02-21 03:39:09,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {14995#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; {14995#true} is VALID [2022-02-21 03:39:09,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {14995#true} assume !(0 != main_~p1~0#1); {14995#true} is VALID [2022-02-21 03:39:09,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {14995#true} assume !(0 != main_~p2~0#1); {14995#true} is VALID [2022-02-21 03:39:09,944 INFO L290 TraceCheckUtils]: 4: Hoare triple {14995#true} assume !(0 != main_~p3~0#1); {14995#true} is VALID [2022-02-21 03:39:09,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {14995#true} assume !(0 != main_~p4~0#1); {14995#true} is VALID [2022-02-21 03:39:09,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {14995#true} assume !(0 != main_~p5~0#1); {14995#true} is VALID [2022-02-21 03:39:09,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {14995#true} assume !(0 != main_~p6~0#1); {14995#true} is VALID [2022-02-21 03:39:09,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {14995#true} assume !(0 != main_~p7~0#1); {14995#true} is VALID [2022-02-21 03:39:09,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {14995#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p1~0#1); {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p2~0#1); {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p3~0#1); {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p4~0#1); {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p5~0#1); {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p6~0#1); {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p7~0#1); {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {14997#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p8~0#1); {14996#false} is VALID [2022-02-21 03:39:09,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {14996#false} assume !(0 != main_~p9~0#1); {14996#false} is VALID [2022-02-21 03:39:09,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {14996#false} assume !(0 != main_~p10~0#1); {14996#false} is VALID [2022-02-21 03:39:09,948 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 03:39:09,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:09,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198586236] [2022-02-21 03:39:09,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198586236] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:09,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:09,950 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:09,950 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058326994] [2022-02-21 03:39:09,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:09,950 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:09,950 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:09,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:09,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:09,951 INFO L87 Difference]: Start difference. First operand 1858 states and 2754 transitions. cyclomatic complexity: 960 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 03:39:10,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:10,312 INFO L93 Difference]: Finished difference Result 3650 states and 5314 transitions. [2022-02-21 03:39:10,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:10,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 03:39:10,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:10,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3650 states and 5314 transitions. [2022-02-21 03:39:10,616 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2022-02-21 03:39:10,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3650 states to 3650 states and 5314 transitions. [2022-02-21 03:39:10,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3650 [2022-02-21 03:39:10,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3650 [2022-02-21 03:39:10,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3650 states and 5314 transitions. [2022-02-21 03:39:10,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:10,907 INFO L681 BuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2022-02-21 03:39:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states and 5314 transitions. [2022-02-21 03:39:10,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3650. [2022-02-21 03:39:10,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:10,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3650 states and 5314 transitions. Second operand has 3650 states, 3650 states have (on average 1.4558904109589041) internal successors, (5314), 3649 states have internal predecessors, (5314), 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 03:39:10,961 INFO L74 IsIncluded]: Start isIncluded. First operand 3650 states and 5314 transitions. Second operand has 3650 states, 3650 states have (on average 1.4558904109589041) internal successors, (5314), 3649 states have internal predecessors, (5314), 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 03:39:10,971 INFO L87 Difference]: Start difference. First operand 3650 states and 5314 transitions. Second operand has 3650 states, 3650 states have (on average 1.4558904109589041) internal successors, (5314), 3649 states have internal predecessors, (5314), 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 03:39:11,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:11,292 INFO L93 Difference]: Finished difference Result 3650 states and 5314 transitions. [2022-02-21 03:39:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3650 states and 5314 transitions. [2022-02-21 03:39:11,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:11,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:11,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 3650 states, 3650 states have (on average 1.4558904109589041) internal successors, (5314), 3649 states have internal predecessors, (5314), 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 3650 states and 5314 transitions. [2022-02-21 03:39:11,309 INFO L87 Difference]: Start difference. First operand has 3650 states, 3650 states have (on average 1.4558904109589041) internal successors, (5314), 3649 states have internal predecessors, (5314), 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 3650 states and 5314 transitions. [2022-02-21 03:39:11,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:11,585 INFO L93 Difference]: Finished difference Result 3650 states and 5314 transitions. [2022-02-21 03:39:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3650 states and 5314 transitions. [2022-02-21 03:39:11,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:11,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:11,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:11,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 3650 states have (on average 1.4558904109589041) internal successors, (5314), 3649 states have internal predecessors, (5314), 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 03:39:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 5314 transitions. [2022-02-21 03:39:11,870 INFO L704 BuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2022-02-21 03:39:11,870 INFO L587 BuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2022-02-21 03:39:11,870 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:39:11,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3650 states and 5314 transitions. [2022-02-21 03:39:11,883 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2022-02-21 03:39:11,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:11,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:11,884 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:11,884 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] [2022-02-21 03:39:11,884 INFO L791 eck$LassoCheckResult]: Stem: 18678#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(16, 2);call #Ultimate.allocInit(12, 3); 18656#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 18657#L155-1 [2022-02-21 03:39:11,884 INFO L793 eck$LassoCheckResult]: Loop: 18657#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 18814#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 18811#L68 assume !(0 != main_~p1~0#1); 18807#L68-2 assume !(0 != main_~p2~0#1); 18804#L72-1 assume !(0 != main_~p3~0#1); 18801#L76-1 assume !(0 != main_~p4~0#1); 18750#L80-1 assume !(0 != main_~p5~0#1); 18736#L84-1 assume !(0 != main_~p6~0#1); 18738#L88-1 assume !(0 != main_~p7~0#1); 18939#L92-1 assume !(0 != main_~p8~0#1); 18940#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 18941#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 18898#L104-1 assume !(0 != main_~p1~0#1); 18895#L110-1 assume !(0 != main_~p2~0#1); 18882#L115-1 assume !(0 != main_~p3~0#1); 18875#L120-1 assume !(0 != main_~p4~0#1); 18870#L125-1 assume !(0 != main_~p5~0#1); 18863#L130-1 assume !(0 != main_~p6~0#1); 18857#L135-1 assume !(0 != main_~p7~0#1); 18852#L140-1 assume !(0 != main_~p8~0#1); 18846#L145-1 assume !(0 != main_~p9~0#1); 18819#L150-1 assume !(0 != main_~p10~0#1); 18657#L155-1 [2022-02-21 03:39:11,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:11,885 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-02-21 03:39:11,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:11,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22491312] [2022-02-21 03:39:11,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:11,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:11,889 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:11,891 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:11,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:11,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1097020517, now seen corresponding path program 1 times [2022-02-21 03:39:11,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:11,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070809628] [2022-02-21 03:39:11,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:11,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:11,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {29603#true} assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {29603#true} is VALID [2022-02-21 03:39:11,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {29603#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; {29603#true} is VALID [2022-02-21 03:39:11,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {29603#true} assume !(0 != main_~p1~0#1); {29603#true} is VALID [2022-02-21 03:39:11,905 INFO L290 TraceCheckUtils]: 3: Hoare triple {29603#true} assume !(0 != main_~p2~0#1); {29603#true} is VALID [2022-02-21 03:39:11,906 INFO L290 TraceCheckUtils]: 4: Hoare triple {29603#true} assume !(0 != main_~p3~0#1); {29603#true} is VALID [2022-02-21 03:39:11,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {29603#true} assume !(0 != main_~p4~0#1); {29603#true} is VALID [2022-02-21 03:39:11,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {29603#true} assume !(0 != main_~p5~0#1); {29603#true} is VALID [2022-02-21 03:39:11,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {29603#true} assume !(0 != main_~p6~0#1); {29603#true} is VALID [2022-02-21 03:39:11,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {29603#true} assume !(0 != main_~p7~0#1); {29603#true} is VALID [2022-02-21 03:39:11,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {29603#true} assume !(0 != main_~p8~0#1); {29603#true} is VALID [2022-02-21 03:39:11,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {29603#true} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:11,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:11,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p1~0#1); {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:11,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p2~0#1); {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:11,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p3~0#1); {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:11,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p4~0#1); {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:11,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p5~0#1); {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:11,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p6~0#1); {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:11,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p7~0#1); {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:11,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p8~0#1); {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:11,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {29605#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p9~0#1); {29604#false} is VALID [2022-02-21 03:39:11,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {29604#false} assume !(0 != main_~p10~0#1); {29604#false} is VALID [2022-02-21 03:39:11,910 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 03:39:11,910 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:11,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070809628] [2022-02-21 03:39:11,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070809628] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:11,911 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:11,911 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:11,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342530382] [2022-02-21 03:39:11,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:11,911 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:11,911 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:11,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:11,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:11,912 INFO L87 Difference]: Start difference. First operand 3650 states and 5314 transitions. cyclomatic complexity: 1792 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 03:39:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:13,033 INFO L93 Difference]: Finished difference Result 7170 states and 10242 transitions. [2022-02-21 03:39:13,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:13,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 03:39:13,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:13,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7170 states and 10242 transitions. [2022-02-21 03:39:14,172 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2022-02-21 03:39:15,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7170 states to 7170 states and 10242 transitions. [2022-02-21 03:39:15,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7170 [2022-02-21 03:39:15,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7170 [2022-02-21 03:39:15,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7170 states and 10242 transitions. [2022-02-21 03:39:15,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:15,243 INFO L681 BuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2022-02-21 03:39:15,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states and 10242 transitions. [2022-02-21 03:39:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 7170. [2022-02-21 03:39:15,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:15,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7170 states and 10242 transitions. Second operand has 7170 states, 7170 states have (on average 1.4284518828451882) internal successors, (10242), 7169 states have internal predecessors, (10242), 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 03:39:15,337 INFO L74 IsIncluded]: Start isIncluded. First operand 7170 states and 10242 transitions. Second operand has 7170 states, 7170 states have (on average 1.4284518828451882) internal successors, (10242), 7169 states have internal predecessors, (10242), 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 03:39:15,345 INFO L87 Difference]: Start difference. First operand 7170 states and 10242 transitions. Second operand has 7170 states, 7170 states have (on average 1.4284518828451882) internal successors, (10242), 7169 states have internal predecessors, (10242), 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 03:39:16,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:16,382 INFO L93 Difference]: Finished difference Result 7170 states and 10242 transitions. [2022-02-21 03:39:16,382 INFO L276 IsEmpty]: Start isEmpty. Operand 7170 states and 10242 transitions. [2022-02-21 03:39:16,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:16,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:16,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 7170 states, 7170 states have (on average 1.4284518828451882) internal successors, (10242), 7169 states have internal predecessors, (10242), 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 7170 states and 10242 transitions. [2022-02-21 03:39:16,400 INFO L87 Difference]: Start difference. First operand has 7170 states, 7170 states have (on average 1.4284518828451882) internal successors, (10242), 7169 states have internal predecessors, (10242), 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 7170 states and 10242 transitions. [2022-02-21 03:39:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:17,435 INFO L93 Difference]: Finished difference Result 7170 states and 10242 transitions. [2022-02-21 03:39:17,435 INFO L276 IsEmpty]: Start isEmpty. Operand 7170 states and 10242 transitions. [2022-02-21 03:39:17,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:17,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:17,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:17,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:17,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7170 states, 7170 states have (on average 1.4284518828451882) internal successors, (10242), 7169 states have internal predecessors, (10242), 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 03:39:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 10242 transitions. [2022-02-21 03:39:18,525 INFO L704 BuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2022-02-21 03:39:18,525 INFO L587 BuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2022-02-21 03:39:18,525 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:39:18,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7170 states and 10242 transitions. [2022-02-21 03:39:18,577 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2022-02-21 03:39:18,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:18,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:18,578 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:18,578 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] [2022-02-21 03:39:18,578 INFO L791 eck$LassoCheckResult]: Stem: 36807#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(16, 2);call #Ultimate.allocInit(12, 3); 36784#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 36785#L155-1 [2022-02-21 03:39:18,578 INFO L793 eck$LassoCheckResult]: Loop: 36785#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 36920#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 36911#L68 assume !(0 != main_~p1~0#1); 36913#L68-2 assume !(0 != main_~p2~0#1); 36900#L72-1 assume !(0 != main_~p3~0#1); 36901#L76-1 assume !(0 != main_~p4~0#1); 37098#L80-1 assume !(0 != main_~p5~0#1); 37096#L84-1 assume !(0 != main_~p6~0#1); 37092#L88-1 assume !(0 != main_~p7~0#1); 37088#L92-1 assume !(0 != main_~p8~0#1); 37084#L96-1 assume !(0 != main_~p9~0#1); 37082#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 37078#L104-1 assume !(0 != main_~p1~0#1); 37074#L110-1 assume !(0 != main_~p2~0#1); 37071#L115-1 assume !(0 != main_~p3~0#1); 37068#L120-1 assume !(0 != main_~p4~0#1); 37063#L125-1 assume !(0 != main_~p5~0#1); 37064#L130-1 assume !(0 != main_~p6~0#1); 37041#L135-1 assume !(0 != main_~p7~0#1); 37043#L140-1 assume !(0 != main_~p8~0#1); 37031#L145-1 assume !(0 != main_~p9~0#1); 37032#L150-1 assume !(0 != main_~p10~0#1); 36785#L155-1 [2022-02-21 03:39:18,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:18,579 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-02-21 03:39:18,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:18,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051467019] [2022-02-21 03:39:18,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:18,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:18,586 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:18,588 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:18,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:18,589 INFO L85 PathProgramCache]: Analyzing trace with hash -838855079, now seen corresponding path program 1 times [2022-02-21 03:39:18,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:18,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677074853] [2022-02-21 03:39:18,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:18,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:18,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {58291#true} assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {58291#true} is VALID [2022-02-21 03:39:18,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {58291#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; {58291#true} is VALID [2022-02-21 03:39:18,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {58291#true} assume !(0 != main_~p1~0#1); {58291#true} is VALID [2022-02-21 03:39:18,602 INFO L290 TraceCheckUtils]: 3: Hoare triple {58291#true} assume !(0 != main_~p2~0#1); {58291#true} is VALID [2022-02-21 03:39:18,602 INFO L290 TraceCheckUtils]: 4: Hoare triple {58291#true} assume !(0 != main_~p3~0#1); {58291#true} is VALID [2022-02-21 03:39:18,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {58291#true} assume !(0 != main_~p4~0#1); {58291#true} is VALID [2022-02-21 03:39:18,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {58291#true} assume !(0 != main_~p5~0#1); {58291#true} is VALID [2022-02-21 03:39:18,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {58291#true} assume !(0 != main_~p6~0#1); {58291#true} is VALID [2022-02-21 03:39:18,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {58291#true} assume !(0 != main_~p7~0#1); {58291#true} is VALID [2022-02-21 03:39:18,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {58291#true} assume !(0 != main_~p8~0#1); {58291#true} is VALID [2022-02-21 03:39:18,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {58291#true} assume !(0 != main_~p9~0#1); {58291#true} is VALID [2022-02-21 03:39:18,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {58291#true} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:18,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p1~0#1); {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:18,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p2~0#1); {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:18,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p3~0#1); {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:18,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p4~0#1); {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:18,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p5~0#1); {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:18,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p6~0#1); {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:18,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p7~0#1); {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:18,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p8~0#1); {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:18,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p9~0#1); {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:18,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {58293#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p10~0#1); {58292#false} is VALID [2022-02-21 03:39:18,607 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 03:39:18,607 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:18,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677074853] [2022-02-21 03:39:18,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677074853] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:18,608 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:18,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:39:18,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608519843] [2022-02-21 03:39:18,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:18,609 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:18,609 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:18,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:18,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:18,610 INFO L87 Difference]: Start difference. First operand 7170 states and 10242 transitions. cyclomatic complexity: 3328 Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 03:39:22,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:22,944 INFO L93 Difference]: Finished difference Result 14082 states and 19714 transitions. [2022-02-21 03:39:22,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:22,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 03:39:22,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:22,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14082 states and 19714 transitions. [2022-02-21 03:39:26,876 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2022-02-21 03:39:30,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14082 states to 14082 states and 19714 transitions. [2022-02-21 03:39:30,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14082 [2022-02-21 03:39:30,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14082 [2022-02-21 03:39:30,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14082 states and 19714 transitions. [2022-02-21 03:39:30,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:30,726 INFO L681 BuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2022-02-21 03:39:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14082 states and 19714 transitions. [2022-02-21 03:39:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14082 to 14082. [2022-02-21 03:39:30,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:30,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14082 states and 19714 transitions. Second operand has 14082 states, 14082 states have (on average 1.3999431898878) internal successors, (19714), 14081 states have internal predecessors, (19714), 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 03:39:30,905 INFO L74 IsIncluded]: Start isIncluded. First operand 14082 states and 19714 transitions. Second operand has 14082 states, 14082 states have (on average 1.3999431898878) internal successors, (19714), 14081 states have internal predecessors, (19714), 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 03:39:30,915 INFO L87 Difference]: Start difference. First operand 14082 states and 19714 transitions. Second operand has 14082 states, 14082 states have (on average 1.3999431898878) internal successors, (19714), 14081 states have internal predecessors, (19714), 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 03:39:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:35,024 INFO L93 Difference]: Finished difference Result 14082 states and 19714 transitions. [2022-02-21 03:39:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 14082 states and 19714 transitions. [2022-02-21 03:39:35,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:35,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:35,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 14082 states, 14082 states have (on average 1.3999431898878) internal successors, (19714), 14081 states have internal predecessors, (19714), 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 14082 states and 19714 transitions. [2022-02-21 03:39:35,109 INFO L87 Difference]: Start difference. First operand has 14082 states, 14082 states have (on average 1.3999431898878) internal successors, (19714), 14081 states have internal predecessors, (19714), 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 14082 states and 19714 transitions. [2022-02-21 03:39:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:39,622 INFO L93 Difference]: Finished difference Result 14082 states and 19714 transitions. [2022-02-21 03:39:39,622 INFO L276 IsEmpty]: Start isEmpty. Operand 14082 states and 19714 transitions. [2022-02-21 03:39:39,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:39,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:39,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:39,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14082 states, 14082 states have (on average 1.3999431898878) internal successors, (19714), 14081 states have internal predecessors, (19714), 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 03:39:43,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14082 states to 14082 states and 19714 transitions. [2022-02-21 03:39:43,534 INFO L704 BuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2022-02-21 03:39:43,534 INFO L587 BuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2022-02-21 03:39:43,535 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 03:39:43,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14082 states and 19714 transitions. [2022-02-21 03:39:43,561 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2022-02-21 03:39:43,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:43,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:43,561 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:43,562 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] [2022-02-21 03:39:43,562 INFO L791 eck$LassoCheckResult]: Stem: 72404#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(16, 2);call #Ultimate.allocInit(12, 3); 72384#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 72385#L155-1 [2022-02-21 03:39:43,562 INFO L793 eck$LassoCheckResult]: Loop: 72385#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 72919#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 72917#L68 assume !(0 != main_~p1~0#1); 72915#L68-2 assume !(0 != main_~p2~0#1); 72914#L72-1 assume !(0 != main_~p3~0#1); 72913#L76-1 assume !(0 != main_~p4~0#1); 72911#L80-1 assume !(0 != main_~p5~0#1); 72909#L84-1 assume !(0 != main_~p6~0#1); 72905#L88-1 assume !(0 != main_~p7~0#1); 72901#L92-1 assume !(0 != main_~p8~0#1); 72897#L96-1 assume !(0 != main_~p9~0#1); 72893#L100-1 assume !(0 != main_~p10~0#1); 72889#L104-1 assume !(0 != main_~p1~0#1); 72885#L110-1 assume !(0 != main_~p2~0#1); 72882#L115-1 assume !(0 != main_~p3~0#1); 72878#L120-1 assume !(0 != main_~p4~0#1); 72879#L125-1 assume !(0 != main_~p5~0#1); 72926#L130-1 assume !(0 != main_~p6~0#1); 72925#L135-1 assume !(0 != main_~p7~0#1); 72923#L140-1 assume !(0 != main_~p8~0#1); 72921#L145-1 assume !(0 != main_~p9~0#1); 72920#L150-1 assume !(0 != main_~p10~0#1); 72385#L155-1 [2022-02-21 03:39:43,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:43,562 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-02-21 03:39:43,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:43,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731324926] [2022-02-21 03:39:43,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:43,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:43,566 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:43,578 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:43,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:43,578 INFO L85 PathProgramCache]: Analyzing trace with hash -137790501, now seen corresponding path program 1 times [2022-02-21 03:39:43,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:43,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50174203] [2022-02-21 03:39:43,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:43,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:43,582 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:43,587 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:43,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:43,591 INFO L85 PathProgramCache]: Analyzing trace with hash -970235363, now seen corresponding path program 1 times [2022-02-21 03:39:43,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:43,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807211329] [2022-02-21 03:39:43,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:43,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:43,596 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:43,612 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:43,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:39:43 BoogieIcfgContainer [2022-02-21 03:39:43,903 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:39:43,904 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:39:43,904 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:39:43,904 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:39:43,904 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:39:07" (3/4) ... [2022-02-21 03:39:43,906 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-02-21 03:39:43,979 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:39:43,979 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:39:43,980 INFO L158 Benchmark]: Toolchain (without parser) took 37023.73ms. Allocated memory was 98.6MB in the beginning and 262.1MB in the end (delta: 163.6MB). Free memory was 65.6MB in the beginning and 131.7MB in the end (delta: -66.1MB). Peak memory consumption was 165.2MB. Max. memory is 16.1GB. [2022-02-21 03:39:43,980 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 98.6MB. Free memory was 54.3MB in the beginning and 54.2MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:39:43,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.67ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 65.4MB in the beginning and 93.4MB in the end (delta: -28.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-02-21 03:39:43,981 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.76ms. Allocated memory is still 119.5MB. Free memory was 93.4MB in the beginning and 91.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:39:43,981 INFO L158 Benchmark]: Boogie Preprocessor took 30.27ms. Allocated memory is still 119.5MB. Free memory was 91.4MB in the beginning and 90.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:39:43,991 INFO L158 Benchmark]: RCFGBuilder took 269.88ms. Allocated memory is still 119.5MB. Free memory was 90.4MB in the beginning and 77.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:39:43,991 INFO L158 Benchmark]: BuchiAutomizer took 36357.29ms. Allocated memory was 119.5MB in the beginning and 262.1MB in the end (delta: 142.6MB). Free memory was 77.8MB in the beginning and 70.8MB in the end (delta: 7.0MB). Peak memory consumption was 150.5MB. Max. memory is 16.1GB. [2022-02-21 03:39:43,991 INFO L158 Benchmark]: Witness Printer took 75.13ms. Allocated memory is still 262.1MB. Free memory was 70.8MB in the beginning and 131.7MB in the end (delta: -60.9MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-02-21 03:39:43,993 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.19ms. Allocated memory is still 98.6MB. Free memory was 54.3MB in the beginning and 54.2MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.67ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 65.4MB in the beginning and 93.4MB in the end (delta: -28.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.76ms. Allocated memory is still 119.5MB. Free memory was 93.4MB in the beginning and 91.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.27ms. Allocated memory is still 119.5MB. Free memory was 91.4MB in the beginning and 90.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 269.88ms. Allocated memory is still 119.5MB. Free memory was 90.4MB in the beginning and 77.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 36357.29ms. Allocated memory was 119.5MB in the beginning and 262.1MB in the end (delta: 142.6MB). Free memory was 77.8MB in the beginning and 70.8MB in the end (delta: 7.0MB). Peak memory consumption was 150.5MB. Max. memory is 16.1GB. * Witness Printer took 75.13ms. Allocated memory is still 262.1MB. Free memory was 70.8MB in the beginning and 131.7MB in the end (delta: -60.9MB). Peak memory consumption was 7.3MB. 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 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 14082 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 36.2s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 6.6s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 17.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 10.8s Buchi closure took 0.0s. Biggest automaton had 14082 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 374 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 374 mSDsluCounter, 1167 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 445 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 722 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 41]: 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 {lk5=0, p1=0, NULL=0, p9=0, lk9=0, NULL=1, cond=4, p5=0, p10=0, lk2=0, p4=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6bfb2ade=0, lk6=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23df4662=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@298f91ba=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e2c6ee0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5fa6bd85=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50f623a2=0, \result=0, lk10=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e86a4f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37771df6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32ce8d95=0, p6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58ee54dc=0, p2=0, lk4=0, lk8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71939ca8=4} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 41]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L39] int cond; Loop: [L41] COND TRUE 1 [L42] cond = __VERIFIER_nondet_int() [L43] COND FALSE !(cond == 0) [L46] lk1 = 0 [L48] lk2 = 0 [L50] lk3 = 0 [L52] lk4 = 0 [L54] lk5 = 0 [L56] lk6 = 0 [L58] lk7 = 0 [L60] lk8 = 0 [L62] lk9 = 0 [L64] lk10 = 0 [L68] COND FALSE !(p1 != 0) [L72] COND FALSE !(p2 != 0) [L76] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L84] COND FALSE !(p5 != 0) [L88] COND FALSE !(p6 != 0) [L92] COND FALSE !(p7 != 0) [L96] COND FALSE !(p8 != 0) [L100] COND FALSE !(p9 != 0) [L104] COND FALSE !(p10 != 0) [L110] COND FALSE !(p1 != 0) [L115] COND FALSE !(p2 != 0) [L120] COND FALSE !(p3 != 0) [L125] COND FALSE !(p4 != 0) [L130] COND FALSE !(p5 != 0) [L135] COND FALSE !(p6 != 0) [L140] COND FALSE !(p7 != 0) [L145] COND FALSE !(p8 != 0) [L150] COND FALSE !(p9 != 0) [L155] COND FALSE !(p10 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-02-21 03:39:44,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- 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)