./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_15-1.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_15-1.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 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:39:53,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:39:53,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:39:53,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:39:53,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:39:53,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:39:53,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:39:53,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:39:53,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:39:53,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:39:54,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:39:54,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:39:54,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:39:54,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:39:54,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:39:54,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:39:54,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:39:54,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:39:54,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:39:54,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:39:54,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:39:54,015 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:39:54,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:39:54,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:39:54,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:39:54,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:39:54,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:39:54,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:39:54,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:39:54,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:39:54,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:39:54,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:39:54,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:39:54,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:39:54,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:39:54,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:39:54,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:39:54,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:39:54,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:39:54,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:39:54,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:39:54,038 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:54,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:39:54,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:39:54,066 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:39:54,066 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:39:54,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:39:54,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:39:54,067 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:39:54,067 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:39:54,067 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:39:54,067 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:39:54,068 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:39:54,068 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:39:54,068 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:39:54,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:39:54,069 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:39:54,069 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:39:54,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:39:54,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:39:54,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:39:54,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:39:54,070 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:39:54,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:39:54,070 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:39:54,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:39:54,070 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:39:54,070 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:39:54,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:39:54,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:39:54,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:39:54,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:39:54,071 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:39:54,072 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:39:54,072 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 -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2022-02-21 03:39:54,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:39:54,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:39:54,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:39:54,257 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:39:54,257 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:39:54,258 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2022-02-21 03:39:54,316 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f05d409/6d9cda244b1f4f24a715cefbacf65eed/FLAG585728a73 [2022-02-21 03:39:54,665 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:39:54,665 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2022-02-21 03:39:54,680 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f05d409/6d9cda244b1f4f24a715cefbacf65eed/FLAG585728a73 [2022-02-21 03:39:55,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f05d409/6d9cda244b1f4f24a715cefbacf65eed [2022-02-21 03:39:55,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:39:55,083 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:39:55,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:39:55,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:39:55,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:39:55,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:39:55" (1/1) ... [2022-02-21 03:39:55,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d2924b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:55, skipping insertion in model container [2022-02-21 03:39:55,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:39:55" (1/1) ... [2022-02-21 03:39:55,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:39:55,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:39:55,230 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_15-1.c[5654,5667] [2022-02-21 03:39:55,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:39:55,250 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:39:55,279 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_15-1.c[5654,5667] [2022-02-21 03:39:55,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:39:55,295 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:39:55,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:55 WrapperNode [2022-02-21 03:39:55,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:39:55,297 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:39:55,298 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:39:55,298 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:39:55,304 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:55" (1/1) ... [2022-02-21 03:39:55,318 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:55" (1/1) ... [2022-02-21 03:39:55,347 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 179 [2022-02-21 03:39:55,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:39:55,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:39:55,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:39:55,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:39:55,356 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:55" (1/1) ... [2022-02-21 03:39:55,356 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:55" (1/1) ... [2022-02-21 03:39:55,362 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:55" (1/1) ... [2022-02-21 03:39:55,362 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:55" (1/1) ... [2022-02-21 03:39:55,380 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:55" (1/1) ... [2022-02-21 03:39:55,383 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:55" (1/1) ... [2022-02-21 03:39:55,384 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:55" (1/1) ... [2022-02-21 03:39:55,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:39:55,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:39:55,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:39:55,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:39:55,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:55" (1/1) ... [2022-02-21 03:39:55,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:39:55,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:39:55,414 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:55,420 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:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:39:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:39:55,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:39:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:39:55,526 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:39:55,527 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:39:55,672 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:39:55,677 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:39:55,677 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:39:55,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:39:55 BoogieIcfgContainer [2022-02-21 03:39:55,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:39:55,679 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:39:55,679 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:39:55,681 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:39:55,682 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:55,682 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:39:55" (1/3) ... [2022-02-21 03:39:55,683 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@285c3bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:39:55, skipping insertion in model container [2022-02-21 03:39:55,683 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:55,683 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:55" (2/3) ... [2022-02-21 03:39:55,683 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@285c3bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:39:55, skipping insertion in model container [2022-02-21 03:39:55,683 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:55,684 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:39:55" (3/3) ... [2022-02-21 03:39:55,684 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_15-1.c [2022-02-21 03:39:55,731 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:39:55,735 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:39:55,735 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:39:55,736 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:39:55,736 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:39:55,736 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:39:55,736 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:39:55,736 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:39:55,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 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:55,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2022-02-21 03:39:55,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:55,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:55,789 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:55,789 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:39:55,789 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:39:55,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 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:55,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2022-02-21 03:39:55,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:55,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:55,796 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:55,796 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:39:55,800 INFO L791 eck$LassoCheckResult]: Stem: 43#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(18, 2);call #Ultimate.allocInit(12, 3); 34#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 22#L225-1true [2022-02-21 03:39:55,801 INFO L793 eck$LassoCheckResult]: Loop: 22#L225-1true assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 33#L58true 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 29#L93true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 27#L93-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 14#L97-1true assume !(0 != main_~p3~0#1); 17#L101-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 50#L105-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 45#L109-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 13#L113-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 24#L117-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 31#L121-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 18#L125-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 36#L129-1true assume !(0 != main_~p11~0#1); 4#L133-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 7#L137-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 40#L141-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 55#L145-1true assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 48#L149-1true assume !(0 != main_~p1~0#1); 47#L155-1true assume 0 != main_~p2~0#1; 9#L161true assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 20#L160true assume !(0 != main_~p3~0#1); 12#L165-1true assume !(0 != main_~p4~0#1); 42#L170-1true assume !(0 != main_~p5~0#1); 46#L175-1true assume !(0 != main_~p6~0#1); 19#L180-1true assume !(0 != main_~p7~0#1); 39#L185-1true assume !(0 != main_~p8~0#1); 26#L190-1true assume !(0 != main_~p9~0#1); 41#L195-1true assume !(0 != main_~p10~0#1); 16#L200-1true assume !(0 != main_~p11~0#1); 44#L205-1true assume !(0 != main_~p12~0#1); 25#L210-1true assume !(0 != main_~p13~0#1); 6#L215-1true assume 0 != main_~p14~0#1; 15#L221true assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 54#L220true assume !(0 != main_~p15~0#1); 22#L225-1true [2022-02-21 03:39:55,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:55,806 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:39:55,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:55,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338016751] [2022-02-21 03:39:55,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:55,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:55,882 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:55,918 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash -638858682, now seen corresponding path program 1 times [2022-02-21 03:39:55,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:55,922 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874651444] [2022-02-21 03:39:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:55,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:56,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#true} assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {60#true} is VALID [2022-02-21 03:39:56,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; {60#true} is VALID [2022-02-21 03:39:56,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {60#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:56,044 INFO L290 TraceCheckUtils]: 3: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:56,044 INFO L290 TraceCheckUtils]: 4: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:56,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:56,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:56,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:56,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:56,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:56,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:56,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:56,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p11~0#1); {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:56,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:56,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:56,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:56,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:56,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {61#false} is VALID [2022-02-21 03:39:56,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {61#false} assume 0 != main_~p2~0#1; {61#false} is VALID [2022-02-21 03:39:56,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {61#false} assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; {61#false} is VALID [2022-02-21 03:39:56,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {61#false} assume !(0 != main_~p3~0#1); {61#false} is VALID [2022-02-21 03:39:56,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {61#false} assume !(0 != main_~p4~0#1); {61#false} is VALID [2022-02-21 03:39:56,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {61#false} assume !(0 != main_~p5~0#1); {61#false} is VALID [2022-02-21 03:39:56,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {61#false} assume !(0 != main_~p6~0#1); {61#false} is VALID [2022-02-21 03:39:56,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {61#false} assume !(0 != main_~p7~0#1); {61#false} is VALID [2022-02-21 03:39:56,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {61#false} assume !(0 != main_~p8~0#1); {61#false} is VALID [2022-02-21 03:39:56,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {61#false} assume !(0 != main_~p9~0#1); {61#false} is VALID [2022-02-21 03:39:56,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {61#false} assume !(0 != main_~p10~0#1); {61#false} is VALID [2022-02-21 03:39:56,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {61#false} assume !(0 != main_~p11~0#1); {61#false} is VALID [2022-02-21 03:39:56,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {61#false} assume !(0 != main_~p12~0#1); {61#false} is VALID [2022-02-21 03:39:56,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {61#false} assume !(0 != main_~p13~0#1); {61#false} is VALID [2022-02-21 03:39:56,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {61#false} assume 0 != main_~p14~0#1; {61#false} is VALID [2022-02-21 03:39:56,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {61#false} assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; {61#false} is VALID [2022-02-21 03:39:56,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {61#false} assume !(0 != main_~p15~0#1); {61#false} is VALID [2022-02-21 03:39:56,057 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:56,057 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:56,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874651444] [2022-02-21 03:39:56,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874651444] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:56,058 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:56,058 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:56,058 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787385671] [2022-02-21 03:39:56,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:56,065 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:56,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:56,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:56,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:56,093 INFO L87 Difference]: Start difference. First operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 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 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:56,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:56,280 INFO L93 Difference]: Finished difference Result 105 states and 190 transitions. [2022-02-21 03:39:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:56,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:56,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:56,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 190 transitions. [2022-02-21 03:39:56,341 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2022-02-21 03:39:56,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 95 states and 149 transitions. [2022-02-21 03:39:56,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2022-02-21 03:39:56,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2022-02-21 03:39:56,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 149 transitions. [2022-02-21 03:39:56,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:56,347 INFO L681 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2022-02-21 03:39:56,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 149 transitions. [2022-02-21 03:39:56,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-02-21 03:39:56,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:56,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states and 149 transitions. Second operand has 95 states, 95 states have (on average 1.568421052631579) internal successors, (149), 94 states have internal predecessors, (149), 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:56,370 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states and 149 transitions. Second operand has 95 states, 95 states have (on average 1.568421052631579) internal successors, (149), 94 states have internal predecessors, (149), 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:56,371 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. Second operand has 95 states, 95 states have (on average 1.568421052631579) internal successors, (149), 94 states have internal predecessors, (149), 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:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:56,376 INFO L93 Difference]: Finished difference Result 95 states and 149 transitions. [2022-02-21 03:39:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 149 transitions. [2022-02-21 03:39:56,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:56,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:56,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 95 states have (on average 1.568421052631579) internal successors, (149), 94 states have internal predecessors, (149), 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 95 states and 149 transitions. [2022-02-21 03:39:56,378 INFO L87 Difference]: Start difference. First operand has 95 states, 95 states have (on average 1.568421052631579) internal successors, (149), 94 states have internal predecessors, (149), 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 95 states and 149 transitions. [2022-02-21 03:39:56,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:56,382 INFO L93 Difference]: Finished difference Result 95 states and 149 transitions. [2022-02-21 03:39:56,382 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 149 transitions. [2022-02-21 03:39:56,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:56,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:56,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:56,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.568421052631579) internal successors, (149), 94 states have internal predecessors, (149), 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:56,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2022-02-21 03:39:56,390 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2022-02-21 03:39:56,390 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2022-02-21 03:39:56,390 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:39:56,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 149 transitions. [2022-02-21 03:39:56,391 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2022-02-21 03:39:56,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:56,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:56,392 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:56,392 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:39:56,392 INFO L791 eck$LassoCheckResult]: Stem: 218#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(18, 2);call #Ultimate.allocInit(12, 3); 212#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 174#L225-1 [2022-02-21 03:39:56,392 INFO L793 eck$LassoCheckResult]: Loop: 174#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 210#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 211#L93 assume !(0 != main_~p1~0#1); 206#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 186#L97-1 assume !(0 != main_~p3~0#1); 187#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 191#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 220#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 182#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 183#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 201#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 192#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 193#L129-1 assume !(0 != main_~p11~0#1); 168#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 169#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 172#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 215#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 226#L149-1 assume !(0 != main_~p1~0#1); 227#L155-1 assume 0 != main_~p2~0#1; 262#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 261#L160 assume !(0 != main_~p3~0#1); 259#L165-1 assume !(0 != main_~p4~0#1); 256#L170-1 assume !(0 != main_~p5~0#1); 255#L175-1 assume !(0 != main_~p6~0#1); 253#L180-1 assume !(0 != main_~p7~0#1); 250#L185-1 assume !(0 != main_~p8~0#1); 249#L190-1 assume !(0 != main_~p9~0#1); 216#L195-1 assume !(0 != main_~p10~0#1); 188#L200-1 assume !(0 != main_~p11~0#1); 189#L205-1 assume !(0 != main_~p12~0#1); 241#L210-1 assume !(0 != main_~p13~0#1); 239#L215-1 assume 0 != main_~p14~0#1; 184#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 185#L220 assume !(0 != main_~p15~0#1); 174#L225-1 [2022-02-21 03:39:56,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:56,393 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:39:56,393 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:56,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764394979] [2022-02-21 03:39:56,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:56,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:56,399 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:56,404 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:56,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:56,405 INFO L85 PathProgramCache]: Analyzing trace with hash -364099068, now seen corresponding path program 1 times [2022-02-21 03:39:56,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:56,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167421524] [2022-02-21 03:39:56,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:56,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:56,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {458#true} assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {458#true} is VALID [2022-02-21 03:39:56,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; {458#true} is VALID [2022-02-21 03:39:56,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} assume !(0 != main_~p1~0#1); {458#true} is VALID [2022-02-21 03:39:56,438 INFO L290 TraceCheckUtils]: 3: Hoare triple {458#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {458#true} is VALID [2022-02-21 03:39:56,438 INFO L290 TraceCheckUtils]: 4: Hoare triple {458#true} assume !(0 != main_~p3~0#1); {458#true} is VALID [2022-02-21 03:39:56,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:56,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:56,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:56,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:56,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:56,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:56,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:56,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p11~0#1); {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:56,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:56,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:56,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:56,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:56,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:56,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p2~0#1; {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:56,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:56,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:56,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {460#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {459#false} is VALID [2022-02-21 03:39:56,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {459#false} assume !(0 != main_~p5~0#1); {459#false} is VALID [2022-02-21 03:39:56,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {459#false} assume !(0 != main_~p6~0#1); {459#false} is VALID [2022-02-21 03:39:56,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {459#false} assume !(0 != main_~p7~0#1); {459#false} is VALID [2022-02-21 03:39:56,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {459#false} assume !(0 != main_~p8~0#1); {459#false} is VALID [2022-02-21 03:39:56,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {459#false} assume !(0 != main_~p9~0#1); {459#false} is VALID [2022-02-21 03:39:56,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {459#false} assume !(0 != main_~p10~0#1); {459#false} is VALID [2022-02-21 03:39:56,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {459#false} assume !(0 != main_~p11~0#1); {459#false} is VALID [2022-02-21 03:39:56,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {459#false} assume !(0 != main_~p12~0#1); {459#false} is VALID [2022-02-21 03:39:56,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {459#false} assume !(0 != main_~p13~0#1); {459#false} is VALID [2022-02-21 03:39:56,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {459#false} assume 0 != main_~p14~0#1; {459#false} is VALID [2022-02-21 03:39:56,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {459#false} assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; {459#false} is VALID [2022-02-21 03:39:56,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {459#false} assume !(0 != main_~p15~0#1); {459#false} is VALID [2022-02-21 03:39:56,447 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:56,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:56,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167421524] [2022-02-21 03:39:56,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167421524] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:56,448 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:56,448 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:56,448 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459613865] [2022-02-21 03:39:56,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:56,449 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:56,449 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:56,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:56,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:56,450 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:56,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:56,528 INFO L93 Difference]: Finished difference Result 186 states and 290 transitions. [2022-02-21 03:39:56,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:56,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:56,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:56,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 290 transitions. [2022-02-21 03:39:56,557 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2022-02-21 03:39:56,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 290 transitions. [2022-02-21 03:39:56,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2022-02-21 03:39:56,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2022-02-21 03:39:56,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 290 transitions. [2022-02-21 03:39:56,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:56,562 INFO L681 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2022-02-21 03:39:56,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 290 transitions. [2022-02-21 03:39:56,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-02-21 03:39:56,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:56,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states and 290 transitions. Second operand has 186 states, 186 states have (on average 1.5591397849462365) internal successors, (290), 185 states have internal predecessors, (290), 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:56,569 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states and 290 transitions. Second operand has 186 states, 186 states have (on average 1.5591397849462365) internal successors, (290), 185 states have internal predecessors, (290), 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:56,569 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. Second operand has 186 states, 186 states have (on average 1.5591397849462365) internal successors, (290), 185 states have internal predecessors, (290), 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:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:56,573 INFO L93 Difference]: Finished difference Result 186 states and 290 transitions. [2022-02-21 03:39:56,573 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 290 transitions. [2022-02-21 03:39:56,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:56,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:56,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 186 states have (on average 1.5591397849462365) internal successors, (290), 185 states have internal predecessors, (290), 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 186 states and 290 transitions. [2022-02-21 03:39:56,575 INFO L87 Difference]: Start difference. First operand has 186 states, 186 states have (on average 1.5591397849462365) internal successors, (290), 185 states have internal predecessors, (290), 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 186 states and 290 transitions. [2022-02-21 03:39:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:56,579 INFO L93 Difference]: Finished difference Result 186 states and 290 transitions. [2022-02-21 03:39:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 290 transitions. [2022-02-21 03:39:56,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:56,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:56,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:56,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.5591397849462365) internal successors, (290), 185 states have internal predecessors, (290), 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:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2022-02-21 03:39:56,584 INFO L704 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2022-02-21 03:39:56,584 INFO L587 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2022-02-21 03:39:56,584 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:39:56,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 290 transitions. [2022-02-21 03:39:56,585 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2022-02-21 03:39:56,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:56,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:56,586 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:56,586 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:39:56,586 INFO L791 eck$LassoCheckResult]: Stem: 698#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(18, 2);call #Ultimate.allocInit(12, 3); 687#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 688#L225-1 [2022-02-21 03:39:56,586 INFO L793 eck$LassoCheckResult]: Loop: 688#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 803#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 802#L93 assume !(0 != main_~p1~0#1); 801#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 710#L97-1 assume !(0 != main_~p3~0#1); 711#L101-1 assume !(0 != main_~p4~0#1); 707#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 700#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 660#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 661#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 678#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 670#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 671#L129-1 assume !(0 != main_~p11~0#1); 647#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 648#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 651#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 815#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 814#L149-1 assume !(0 != main_~p1~0#1); 769#L155-1 assume 0 != main_~p2~0#1; 770#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 766#L160 assume !(0 != main_~p3~0#1); 765#L165-1 assume !(0 != main_~p4~0#1); 771#L170-1 assume !(0 != main_~p5~0#1); 827#L175-1 assume !(0 != main_~p6~0#1); 824#L180-1 assume !(0 != main_~p7~0#1); 819#L185-1 assume !(0 != main_~p8~0#1); 817#L190-1 assume !(0 != main_~p9~0#1); 813#L195-1 assume !(0 != main_~p10~0#1); 665#L200-1 assume !(0 != main_~p11~0#1); 666#L205-1 assume !(0 != main_~p12~0#1); 809#L210-1 assume !(0 != main_~p13~0#1); 807#L215-1 assume 0 != main_~p14~0#1; 806#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 805#L220 assume !(0 != main_~p15~0#1); 688#L225-1 [2022-02-21 03:39:56,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:56,587 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-02-21 03:39:56,587 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:56,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355234078] [2022-02-21 03:39:56,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:56,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:56,592 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:56,596 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:56,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:56,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1022104326, now seen corresponding path program 1 times [2022-02-21 03:39:56,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:56,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715222523] [2022-02-21 03:39:56,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:56,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:56,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {1210#true} assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {1210#true} is VALID [2022-02-21 03:39:56,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; {1210#true} is VALID [2022-02-21 03:39:56,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#true} assume !(0 != main_~p1~0#1); {1210#true} is VALID [2022-02-21 03:39:56,636 INFO L290 TraceCheckUtils]: 3: Hoare triple {1210#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1210#true} is VALID [2022-02-21 03:39:56,637 INFO L290 TraceCheckUtils]: 4: Hoare triple {1210#true} assume !(0 != main_~p3~0#1); {1210#true} is VALID [2022-02-21 03:39:56,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#true} assume !(0 != main_~p4~0#1); {1210#true} is VALID [2022-02-21 03:39:56,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {1210#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:56,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:56,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:56,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:56,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:56,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:56,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p11~0#1); {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:56,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:56,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:56,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:56,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:56,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:56,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p2~0#1; {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:56,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:56,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:56,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:56,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {1211#false} is VALID [2022-02-21 03:39:56,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {1211#false} assume !(0 != main_~p6~0#1); {1211#false} is VALID [2022-02-21 03:39:56,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {1211#false} assume !(0 != main_~p7~0#1); {1211#false} is VALID [2022-02-21 03:39:56,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {1211#false} assume !(0 != main_~p8~0#1); {1211#false} is VALID [2022-02-21 03:39:56,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {1211#false} assume !(0 != main_~p9~0#1); {1211#false} is VALID [2022-02-21 03:39:56,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {1211#false} assume !(0 != main_~p10~0#1); {1211#false} is VALID [2022-02-21 03:39:56,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {1211#false} assume !(0 != main_~p11~0#1); {1211#false} is VALID [2022-02-21 03:39:56,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {1211#false} assume !(0 != main_~p12~0#1); {1211#false} is VALID [2022-02-21 03:39:56,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {1211#false} assume !(0 != main_~p13~0#1); {1211#false} is VALID [2022-02-21 03:39:56,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {1211#false} assume 0 != main_~p14~0#1; {1211#false} is VALID [2022-02-21 03:39:56,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {1211#false} assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; {1211#false} is VALID [2022-02-21 03:39:56,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {1211#false} assume !(0 != main_~p15~0#1); {1211#false} is VALID [2022-02-21 03:39:56,645 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:56,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:56,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715222523] [2022-02-21 03:39:56,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715222523] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:56,646 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:56,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:56,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661014906] [2022-02-21 03:39:56,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:56,646 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:56,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:56,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:56,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:56,647 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. cyclomatic complexity: 108 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:56,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:56,724 INFO L93 Difference]: Finished difference Result 366 states and 566 transitions. [2022-02-21 03:39:56,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:56,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:56,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:56,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 566 transitions. [2022-02-21 03:39:56,763 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2022-02-21 03:39:56,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 566 transitions. [2022-02-21 03:39:56,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2022-02-21 03:39:56,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2022-02-21 03:39:56,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 566 transitions. [2022-02-21 03:39:56,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:56,774 INFO L681 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2022-02-21 03:39:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 566 transitions. [2022-02-21 03:39:56,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2022-02-21 03:39:56,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:56,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states and 566 transitions. Second operand has 366 states, 366 states have (on average 1.546448087431694) internal successors, (566), 365 states have internal predecessors, (566), 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:56,783 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states and 566 transitions. Second operand has 366 states, 366 states have (on average 1.546448087431694) internal successors, (566), 365 states have internal predecessors, (566), 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:56,784 INFO L87 Difference]: Start difference. First operand 366 states and 566 transitions. Second operand has 366 states, 366 states have (on average 1.546448087431694) internal successors, (566), 365 states have internal predecessors, (566), 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:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:56,801 INFO L93 Difference]: Finished difference Result 366 states and 566 transitions. [2022-02-21 03:39:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 566 transitions. [2022-02-21 03:39:56,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:56,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:56,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 366 states, 366 states have (on average 1.546448087431694) internal successors, (566), 365 states have internal predecessors, (566), 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 366 states and 566 transitions. [2022-02-21 03:39:56,803 INFO L87 Difference]: Start difference. First operand has 366 states, 366 states have (on average 1.546448087431694) internal successors, (566), 365 states have internal predecessors, (566), 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 366 states and 566 transitions. [2022-02-21 03:39:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:56,811 INFO L93 Difference]: Finished difference Result 366 states and 566 transitions. [2022-02-21 03:39:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 566 transitions. [2022-02-21 03:39:56,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:56,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:56,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:56,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.546448087431694) internal successors, (566), 365 states have internal predecessors, (566), 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:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 566 transitions. [2022-02-21 03:39:56,821 INFO L704 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2022-02-21 03:39:56,821 INFO L587 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2022-02-21 03:39:56,821 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:39:56,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 566 transitions. [2022-02-21 03:39:56,823 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2022-02-21 03:39:56,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:56,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:56,824 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:56,825 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:39:56,827 INFO L791 eck$LassoCheckResult]: Stem: 1628#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(18, 2);call #Ultimate.allocInit(12, 3); 1621#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1622#L225-1 [2022-02-21 03:39:56,827 INFO L793 eck$LassoCheckResult]: Loop: 1622#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1649#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 1650#L93 assume !(0 != main_~p1~0#1); 1776#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 1794#L97-1 assume !(0 != main_~p3~0#1); 1791#L101-1 assume !(0 != main_~p4~0#1); 1788#L105-1 assume !(0 != main_~p5~0#1); 1786#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1785#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1783#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1781#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1779#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1777#L129-1 assume !(0 != main_~p11~0#1); 1774#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1771#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1768#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1764#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 1738#L149-1 assume !(0 != main_~p1~0#1); 1736#L155-1 assume 0 != main_~p2~0#1; 1733#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 1731#L160 assume !(0 != main_~p3~0#1); 1727#L165-1 assume !(0 != main_~p4~0#1); 1724#L170-1 assume !(0 != main_~p5~0#1); 1703#L175-1 assume !(0 != main_~p6~0#1); 1699#L180-1 assume !(0 != main_~p7~0#1); 1698#L185-1 assume !(0 != main_~p8~0#1); 1689#L190-1 assume !(0 != main_~p9~0#1); 1684#L195-1 assume !(0 != main_~p10~0#1); 1683#L200-1 assume !(0 != main_~p11~0#1); 1803#L205-1 assume !(0 != main_~p12~0#1); 1668#L210-1 assume !(0 != main_~p13~0#1); 1663#L215-1 assume 0 != main_~p14~0#1; 1660#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 1657#L220 assume !(0 != main_~p15~0#1); 1622#L225-1 [2022-02-21 03:39:56,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:56,828 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-02-21 03:39:56,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:56,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424676033] [2022-02-21 03:39:56,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:56,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:56,844 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:56,857 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:56,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:56,859 INFO L85 PathProgramCache]: Analyzing trace with hash 512631236, now seen corresponding path program 1 times [2022-02-21 03:39:56,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:56,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953474621] [2022-02-21 03:39:56,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:56,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:56,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {2682#true} assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {2682#true} is VALID [2022-02-21 03:39:56,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {2682#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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; {2682#true} is VALID [2022-02-21 03:39:56,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {2682#true} assume !(0 != main_~p1~0#1); {2682#true} is VALID [2022-02-21 03:39:56,898 INFO L290 TraceCheckUtils]: 3: Hoare triple {2682#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {2682#true} is VALID [2022-02-21 03:39:56,898 INFO L290 TraceCheckUtils]: 4: Hoare triple {2682#true} assume !(0 != main_~p3~0#1); {2682#true} is VALID [2022-02-21 03:39:56,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {2682#true} assume !(0 != main_~p4~0#1); {2682#true} is VALID [2022-02-21 03:39:56,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {2682#true} assume !(0 != main_~p5~0#1); {2682#true} is VALID [2022-02-21 03:39:56,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {2682#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:56,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:56,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:56,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:56,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:56,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p11~0#1); {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:56,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:56,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:56,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:56,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:56,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:56,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p2~0#1; {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:56,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:56,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:56,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:56,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:56,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {2683#false} is VALID [2022-02-21 03:39:56,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {2683#false} assume !(0 != main_~p7~0#1); {2683#false} is VALID [2022-02-21 03:39:56,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {2683#false} assume !(0 != main_~p8~0#1); {2683#false} is VALID [2022-02-21 03:39:56,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {2683#false} assume !(0 != main_~p9~0#1); {2683#false} is VALID [2022-02-21 03:39:56,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {2683#false} assume !(0 != main_~p10~0#1); {2683#false} is VALID [2022-02-21 03:39:56,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {2683#false} assume !(0 != main_~p11~0#1); {2683#false} is VALID [2022-02-21 03:39:56,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {2683#false} assume !(0 != main_~p12~0#1); {2683#false} is VALID [2022-02-21 03:39:56,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {2683#false} assume !(0 != main_~p13~0#1); {2683#false} is VALID [2022-02-21 03:39:56,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {2683#false} assume 0 != main_~p14~0#1; {2683#false} is VALID [2022-02-21 03:39:56,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {2683#false} assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; {2683#false} is VALID [2022-02-21 03:39:56,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {2683#false} assume !(0 != main_~p15~0#1); {2683#false} is VALID [2022-02-21 03:39:56,915 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:56,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:56,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953474621] [2022-02-21 03:39:56,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953474621] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:56,917 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:56,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:56,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166548186] [2022-02-21 03:39:56,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:56,918 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:56,918 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:56,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:56,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:56,919 INFO L87 Difference]: Start difference. First operand 366 states and 566 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:57,007 INFO L93 Difference]: Finished difference Result 722 states and 1106 transitions. [2022-02-21 03:39:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:57,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:57,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:57,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1106 transitions. [2022-02-21 03:39:57,047 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2022-02-21 03:39:57,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1106 transitions. [2022-02-21 03:39:57,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2022-02-21 03:39:57,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2022-02-21 03:39:57,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1106 transitions. [2022-02-21 03:39:57,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:57,065 INFO L681 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2022-02-21 03:39:57,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1106 transitions. [2022-02-21 03:39:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2022-02-21 03:39:57,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:57,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 722 states and 1106 transitions. Second operand has 722 states, 722 states have (on average 1.5318559556786704) internal successors, (1106), 721 states have internal predecessors, (1106), 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:57,076 INFO L74 IsIncluded]: Start isIncluded. First operand 722 states and 1106 transitions. Second operand has 722 states, 722 states have (on average 1.5318559556786704) internal successors, (1106), 721 states have internal predecessors, (1106), 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:57,077 INFO L87 Difference]: Start difference. First operand 722 states and 1106 transitions. Second operand has 722 states, 722 states have (on average 1.5318559556786704) internal successors, (1106), 721 states have internal predecessors, (1106), 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:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:57,092 INFO L93 Difference]: Finished difference Result 722 states and 1106 transitions. [2022-02-21 03:39:57,092 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1106 transitions. [2022-02-21 03:39:57,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:57,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:57,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 722 states, 722 states have (on average 1.5318559556786704) internal successors, (1106), 721 states have internal predecessors, (1106), 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 722 states and 1106 transitions. [2022-02-21 03:39:57,096 INFO L87 Difference]: Start difference. First operand has 722 states, 722 states have (on average 1.5318559556786704) internal successors, (1106), 721 states have internal predecessors, (1106), 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 722 states and 1106 transitions. [2022-02-21 03:39:57,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:57,111 INFO L93 Difference]: Finished difference Result 722 states and 1106 transitions. [2022-02-21 03:39:57,111 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1106 transitions. [2022-02-21 03:39:57,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:57,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:57,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:57,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:57,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 722 states have (on average 1.5318559556786704) internal successors, (1106), 721 states have internal predecessors, (1106), 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:57,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1106 transitions. [2022-02-21 03:39:57,136 INFO L704 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2022-02-21 03:39:57,136 INFO L587 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2022-02-21 03:39:57,137 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:39:57,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1106 transitions. [2022-02-21 03:39:57,139 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2022-02-21 03:39:57,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:57,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:57,140 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:57,140 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:39:57,140 INFO L791 eck$LassoCheckResult]: Stem: 3461#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(18, 2);call #Ultimate.allocInit(12, 3); 3451#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 3452#L225-1 [2022-02-21 03:39:57,140 INFO L793 eck$LassoCheckResult]: Loop: 3452#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 3777#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 3778#L93 assume !(0 != main_~p1~0#1); 3852#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 3850#L97-1 assume !(0 != main_~p3~0#1); 3848#L101-1 assume !(0 != main_~p4~0#1); 3693#L105-1 assume !(0 != main_~p5~0#1); 3694#L109-1 assume !(0 != main_~p6~0#1); 3682#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3683#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3671#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3672#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3661#L129-1 assume !(0 != main_~p11~0#1); 3662#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 3651#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 3652#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 3641#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 3642#L149-1 assume !(0 != main_~p1~0#1); 3607#L155-1 assume 0 != main_~p2~0#1; 3608#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 3595#L160 assume !(0 != main_~p3~0#1); 3594#L165-1 assume !(0 != main_~p4~0#1); 3834#L170-1 assume !(0 != main_~p5~0#1); 3835#L175-1 assume !(0 != main_~p6~0#1); 3884#L180-1 assume !(0 != main_~p7~0#1); 3879#L185-1 assume !(0 != main_~p8~0#1); 3876#L190-1 assume !(0 != main_~p9~0#1); 3872#L195-1 assume !(0 != main_~p10~0#1); 3868#L200-1 assume !(0 != main_~p11~0#1); 3864#L205-1 assume !(0 != main_~p12~0#1); 3860#L210-1 assume !(0 != main_~p13~0#1); 3857#L215-1 assume 0 != main_~p14~0#1; 3855#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 3838#L220 assume !(0 != main_~p15~0#1); 3452#L225-1 [2022-02-21 03:39:57,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:57,141 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-02-21 03:39:57,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:57,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099646193] [2022-02-21 03:39:57,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:57,145 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:57,149 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:57,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:57,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1859108026, now seen corresponding path program 1 times [2022-02-21 03:39:57,149 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:57,149 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574604461] [2022-02-21 03:39:57,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:57,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:57,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {5578#true} assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {5578#true} is VALID [2022-02-21 03:39:57,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {5578#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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; {5578#true} is VALID [2022-02-21 03:39:57,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {5578#true} assume !(0 != main_~p1~0#1); {5578#true} is VALID [2022-02-21 03:39:57,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {5578#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {5578#true} is VALID [2022-02-21 03:39:57,169 INFO L290 TraceCheckUtils]: 4: Hoare triple {5578#true} assume !(0 != main_~p3~0#1); {5578#true} is VALID [2022-02-21 03:39:57,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {5578#true} assume !(0 != main_~p4~0#1); {5578#true} is VALID [2022-02-21 03:39:57,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {5578#true} assume !(0 != main_~p5~0#1); {5578#true} is VALID [2022-02-21 03:39:57,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {5578#true} assume !(0 != main_~p6~0#1); {5578#true} is VALID [2022-02-21 03:39:57,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {5578#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:57,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:57,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:57,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:57,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p11~0#1); {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:57,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:57,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:57,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:57,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:57,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p1~0#1); {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:57,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p2~0#1; {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:57,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:57,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p3~0#1); {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:57,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p4~0#1); {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:57,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p5~0#1); {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:57,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p6~0#1); {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:57,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p7~0#1); {5579#false} is VALID [2022-02-21 03:39:57,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {5579#false} assume !(0 != main_~p8~0#1); {5579#false} is VALID [2022-02-21 03:39:57,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {5579#false} assume !(0 != main_~p9~0#1); {5579#false} is VALID [2022-02-21 03:39:57,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {5579#false} assume !(0 != main_~p10~0#1); {5579#false} is VALID [2022-02-21 03:39:57,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {5579#false} assume !(0 != main_~p11~0#1); {5579#false} is VALID [2022-02-21 03:39:57,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {5579#false} assume !(0 != main_~p12~0#1); {5579#false} is VALID [2022-02-21 03:39:57,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {5579#false} assume !(0 != main_~p13~0#1); {5579#false} is VALID [2022-02-21 03:39:57,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {5579#false} assume 0 != main_~p14~0#1; {5579#false} is VALID [2022-02-21 03:39:57,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {5579#false} assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; {5579#false} is VALID [2022-02-21 03:39:57,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {5579#false} assume !(0 != main_~p15~0#1); {5579#false} is VALID [2022-02-21 03:39:57,177 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:57,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:57,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574604461] [2022-02-21 03:39:57,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574604461] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:57,177 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:57,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:57,178 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515258953] [2022-02-21 03:39:57,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:57,178 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:57,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:57,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:57,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:57,179 INFO L87 Difference]: Start difference. First operand 722 states and 1106 transitions. cyclomatic complexity: 400 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:57,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:57,334 INFO L93 Difference]: Finished difference Result 1426 states and 2162 transitions. [2022-02-21 03:39:57,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:57,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:57,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:57,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2162 transitions. [2022-02-21 03:39:57,409 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2022-02-21 03:39:57,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2162 transitions. [2022-02-21 03:39:57,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2022-02-21 03:39:57,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2022-02-21 03:39:57,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2162 transitions. [2022-02-21 03:39:57,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:57,460 INFO L681 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2022-02-21 03:39:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2162 transitions. [2022-02-21 03:39:57,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2022-02-21 03:39:57,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:57,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1426 states and 2162 transitions. Second operand has 1426 states, 1426 states have (on average 1.5161290322580645) internal successors, (2162), 1425 states have internal predecessors, (2162), 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:57,477 INFO L74 IsIncluded]: Start isIncluded. First operand 1426 states and 2162 transitions. Second operand has 1426 states, 1426 states have (on average 1.5161290322580645) internal successors, (2162), 1425 states have internal predecessors, (2162), 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:57,480 INFO L87 Difference]: Start difference. First operand 1426 states and 2162 transitions. Second operand has 1426 states, 1426 states have (on average 1.5161290322580645) internal successors, (2162), 1425 states have internal predecessors, (2162), 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:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:57,526 INFO L93 Difference]: Finished difference Result 1426 states and 2162 transitions. [2022-02-21 03:39:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2162 transitions. [2022-02-21 03:39:57,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:57,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:57,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 1426 states, 1426 states have (on average 1.5161290322580645) internal successors, (2162), 1425 states have internal predecessors, (2162), 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 1426 states and 2162 transitions. [2022-02-21 03:39:57,532 INFO L87 Difference]: Start difference. First operand has 1426 states, 1426 states have (on average 1.5161290322580645) internal successors, (2162), 1425 states have internal predecessors, (2162), 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 1426 states and 2162 transitions. [2022-02-21 03:39:57,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:57,579 INFO L93 Difference]: Finished difference Result 1426 states and 2162 transitions. [2022-02-21 03:39:57,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2162 transitions. [2022-02-21 03:39:57,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:57,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:57,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:57,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:57,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1426 states have (on average 1.5161290322580645) internal successors, (2162), 1425 states have internal predecessors, (2162), 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:57,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2162 transitions. [2022-02-21 03:39:57,630 INFO L704 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2022-02-21 03:39:57,630 INFO L587 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2022-02-21 03:39:57,630 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:39:57,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2162 transitions. [2022-02-21 03:39:57,635 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2022-02-21 03:39:57,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:57,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:57,635 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:57,635 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:39:57,636 INFO L791 eck$LassoCheckResult]: Stem: 7061#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(18, 2);call #Ultimate.allocInit(12, 3); 7051#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 7052#L225-1 [2022-02-21 03:39:57,636 INFO L793 eck$LassoCheckResult]: Loop: 7052#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 7409#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 7408#L93 assume !(0 != main_~p1~0#1); 7103#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 7096#L97-1 assume !(0 != main_~p3~0#1); 7097#L101-1 assume !(0 != main_~p4~0#1); 7324#L105-1 assume !(0 != main_~p5~0#1); 7319#L109-1 assume !(0 != main_~p6~0#1); 7315#L113-1 assume !(0 != main_~p7~0#1); 7312#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 7309#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 7306#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 7302#L129-1 assume !(0 != main_~p11~0#1); 7299#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 7296#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 7292#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 7289#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 7286#L149-1 assume !(0 != main_~p1~0#1); 7284#L155-1 assume 0 != main_~p2~0#1; 7283#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 7280#L160 assume !(0 != main_~p3~0#1); 7277#L165-1 assume !(0 != main_~p4~0#1); 7278#L170-1 assume !(0 != main_~p5~0#1); 7455#L175-1 assume !(0 != main_~p6~0#1); 7453#L180-1 assume !(0 != main_~p7~0#1); 7449#L185-1 assume !(0 != main_~p8~0#1); 7446#L190-1 assume !(0 != main_~p9~0#1); 7442#L195-1 assume !(0 != main_~p10~0#1); 7438#L200-1 assume !(0 != main_~p11~0#1); 7434#L205-1 assume !(0 != main_~p12~0#1); 7430#L210-1 assume !(0 != main_~p13~0#1); 7425#L215-1 assume 0 != main_~p14~0#1; 7421#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 7418#L220 assume !(0 != main_~p15~0#1); 7052#L225-1 [2022-02-21 03:39:57,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:57,636 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-02-21 03:39:57,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:57,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018994860] [2022-02-21 03:39:57,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:57,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:57,640 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:57,643 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:57,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:57,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1797068412, now seen corresponding path program 1 times [2022-02-21 03:39:57,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:57,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750062722] [2022-02-21 03:39:57,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:57,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:57,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {11290#true} assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {11290#true} is VALID [2022-02-21 03:39:57,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {11290#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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; {11290#true} is VALID [2022-02-21 03:39:57,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {11290#true} assume !(0 != main_~p1~0#1); {11290#true} is VALID [2022-02-21 03:39:57,663 INFO L290 TraceCheckUtils]: 3: Hoare triple {11290#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {11290#true} is VALID [2022-02-21 03:39:57,663 INFO L290 TraceCheckUtils]: 4: Hoare triple {11290#true} assume !(0 != main_~p3~0#1); {11290#true} is VALID [2022-02-21 03:39:57,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {11290#true} assume !(0 != main_~p4~0#1); {11290#true} is VALID [2022-02-21 03:39:57,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {11290#true} assume !(0 != main_~p5~0#1); {11290#true} is VALID [2022-02-21 03:39:57,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {11290#true} assume !(0 != main_~p6~0#1); {11290#true} is VALID [2022-02-21 03:39:57,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {11290#true} assume !(0 != main_~p7~0#1); {11290#true} is VALID [2022-02-21 03:39:57,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {11290#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:57,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:57,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:57,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p11~0#1); {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:57,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:57,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:57,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:57,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:57,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p1~0#1); {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:57,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p2~0#1; {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:57,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:57,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p3~0#1); {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:57,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p4~0#1); {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:57,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p5~0#1); {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:57,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p6~0#1); {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:57,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p7~0#1); {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:57,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p8~0#1); {11291#false} is VALID [2022-02-21 03:39:57,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {11291#false} assume !(0 != main_~p9~0#1); {11291#false} is VALID [2022-02-21 03:39:57,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {11291#false} assume !(0 != main_~p10~0#1); {11291#false} is VALID [2022-02-21 03:39:57,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {11291#false} assume !(0 != main_~p11~0#1); {11291#false} is VALID [2022-02-21 03:39:57,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {11291#false} assume !(0 != main_~p12~0#1); {11291#false} is VALID [2022-02-21 03:39:57,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {11291#false} assume !(0 != main_~p13~0#1); {11291#false} is VALID [2022-02-21 03:39:57,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {11291#false} assume 0 != main_~p14~0#1; {11291#false} is VALID [2022-02-21 03:39:57,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {11291#false} assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; {11291#false} is VALID [2022-02-21 03:39:57,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {11291#false} assume !(0 != main_~p15~0#1); {11291#false} is VALID [2022-02-21 03:39:57,670 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:57,670 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:57,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750062722] [2022-02-21 03:39:57,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750062722] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:57,670 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:57,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:57,671 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694486564] [2022-02-21 03:39:57,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:57,671 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:57,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:57,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:57,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:57,672 INFO L87 Difference]: Start difference. First operand 1426 states and 2162 transitions. cyclomatic complexity: 768 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:57,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:57,912 INFO L93 Difference]: Finished difference Result 2818 states and 4226 transitions. [2022-02-21 03:39:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:57,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:57,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:57,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4226 transitions. [2022-02-21 03:39:58,126 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2022-02-21 03:39:58,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4226 transitions. [2022-02-21 03:39:58,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2022-02-21 03:39:58,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2022-02-21 03:39:58,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4226 transitions. [2022-02-21 03:39:58,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:58,308 INFO L681 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2022-02-21 03:39:58,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4226 transitions. [2022-02-21 03:39:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2022-02-21 03:39:58,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:58,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2818 states and 4226 transitions. Second operand has 2818 states, 2818 states have (on average 1.4996451383960256) internal successors, (4226), 2817 states have internal predecessors, (4226), 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:58,348 INFO L74 IsIncluded]: Start isIncluded. First operand 2818 states and 4226 transitions. Second operand has 2818 states, 2818 states have (on average 1.4996451383960256) internal successors, (4226), 2817 states have internal predecessors, (4226), 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:58,364 INFO L87 Difference]: Start difference. First operand 2818 states and 4226 transitions. Second operand has 2818 states, 2818 states have (on average 1.4996451383960256) internal successors, (4226), 2817 states have internal predecessors, (4226), 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:58,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:58,535 INFO L93 Difference]: Finished difference Result 2818 states and 4226 transitions. [2022-02-21 03:39:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 4226 transitions. [2022-02-21 03:39:58,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:58,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:58,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 2818 states, 2818 states have (on average 1.4996451383960256) internal successors, (4226), 2817 states have internal predecessors, (4226), 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 2818 states and 4226 transitions. [2022-02-21 03:39:58,547 INFO L87 Difference]: Start difference. First operand has 2818 states, 2818 states have (on average 1.4996451383960256) internal successors, (4226), 2817 states have internal predecessors, (4226), 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 2818 states and 4226 transitions. [2022-02-21 03:39:58,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:58,750 INFO L93 Difference]: Finished difference Result 2818 states and 4226 transitions. [2022-02-21 03:39:58,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 4226 transitions. [2022-02-21 03:39:58,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:58,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:58,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:58,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2818 states have (on average 1.4996451383960256) internal successors, (4226), 2817 states have internal predecessors, (4226), 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:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4226 transitions. [2022-02-21 03:39:58,929 INFO L704 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2022-02-21 03:39:58,929 INFO L587 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2022-02-21 03:39:58,929 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:39:58,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4226 transitions. [2022-02-21 03:39:58,938 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2022-02-21 03:39:58,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:58,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:58,939 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:58,939 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:39:58,939 INFO L791 eck$LassoCheckResult]: Stem: 14167#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(18, 2);call #Ultimate.allocInit(12, 3); 14159#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 14160#L225-1 [2022-02-21 03:39:58,939 INFO L793 eck$LassoCheckResult]: Loop: 14160#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 14310#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 14311#L93 assume !(0 != main_~p1~0#1); 14428#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 14427#L97-1 assume !(0 != main_~p3~0#1); 14425#L101-1 assume !(0 != main_~p4~0#1); 14422#L105-1 assume !(0 != main_~p5~0#1); 14418#L109-1 assume !(0 != main_~p6~0#1); 14414#L113-1 assume !(0 != main_~p7~0#1); 14410#L117-1 assume !(0 != main_~p8~0#1); 14408#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 14406#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 14404#L129-1 assume !(0 != main_~p11~0#1); 14402#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 14400#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 14398#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 14396#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 14393#L149-1 assume !(0 != main_~p1~0#1); 14394#L155-1 assume 0 != main_~p2~0#1; 14383#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 14384#L160 assume !(0 != main_~p3~0#1); 14375#L165-1 assume !(0 != main_~p4~0#1); 14376#L170-1 assume !(0 != main_~p5~0#1); 14364#L175-1 assume !(0 != main_~p6~0#1); 14366#L180-1 assume !(0 != main_~p7~0#1); 14355#L185-1 assume !(0 != main_~p8~0#1); 14356#L190-1 assume !(0 != main_~p9~0#1); 14347#L195-1 assume !(0 != main_~p10~0#1); 14346#L200-1 assume !(0 != main_~p11~0#1); 14336#L205-1 assume !(0 != main_~p12~0#1); 14335#L210-1 assume !(0 != main_~p13~0#1); 14324#L215-1 assume 0 != main_~p14~0#1; 14325#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 14318#L220 assume !(0 != main_~p15~0#1); 14160#L225-1 [2022-02-21 03:39:58,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:58,940 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-02-21 03:39:58,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:58,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24968305] [2022-02-21 03:39:58,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:58,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:58,944 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:58,947 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:58,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:58,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1656519802, now seen corresponding path program 1 times [2022-02-21 03:39:58,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:58,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903964046] [2022-02-21 03:39:58,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:58,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:58,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {22570#true} assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {22570#true} is VALID [2022-02-21 03:39:58,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {22570#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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; {22570#true} is VALID [2022-02-21 03:39:58,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {22570#true} assume !(0 != main_~p1~0#1); {22570#true} is VALID [2022-02-21 03:39:58,985 INFO L290 TraceCheckUtils]: 3: Hoare triple {22570#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {22570#true} is VALID [2022-02-21 03:39:58,985 INFO L290 TraceCheckUtils]: 4: Hoare triple {22570#true} assume !(0 != main_~p3~0#1); {22570#true} is VALID [2022-02-21 03:39:58,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {22570#true} assume !(0 != main_~p4~0#1); {22570#true} is VALID [2022-02-21 03:39:58,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {22570#true} assume !(0 != main_~p5~0#1); {22570#true} is VALID [2022-02-21 03:39:58,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {22570#true} assume !(0 != main_~p6~0#1); {22570#true} is VALID [2022-02-21 03:39:58,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {22570#true} assume !(0 != main_~p7~0#1); {22570#true} is VALID [2022-02-21 03:39:58,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {22570#true} assume !(0 != main_~p8~0#1); {22570#true} is VALID [2022-02-21 03:39:58,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {22570#true} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:58,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:58,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p11~0#1); {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:58,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:58,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:58,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:58,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:58,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p1~0#1); {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:58,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p2~0#1; {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:58,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:58,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p3~0#1); {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:58,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p4~0#1); {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:58,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p5~0#1); {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:58,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p6~0#1); {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:58,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p7~0#1); {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:58,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p8~0#1); {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:58,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p9~0#1); {22571#false} is VALID [2022-02-21 03:39:58,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {22571#false} assume !(0 != main_~p10~0#1); {22571#false} is VALID [2022-02-21 03:39:58,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {22571#false} assume !(0 != main_~p11~0#1); {22571#false} is VALID [2022-02-21 03:39:58,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {22571#false} assume !(0 != main_~p12~0#1); {22571#false} is VALID [2022-02-21 03:39:58,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {22571#false} assume !(0 != main_~p13~0#1); {22571#false} is VALID [2022-02-21 03:39:58,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {22571#false} assume 0 != main_~p14~0#1; {22571#false} is VALID [2022-02-21 03:39:58,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {22571#false} assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; {22571#false} is VALID [2022-02-21 03:39:58,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {22571#false} assume !(0 != main_~p15~0#1); {22571#false} is VALID [2022-02-21 03:39:58,992 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:58,992 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:58,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903964046] [2022-02-21 03:39:58,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903964046] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:58,993 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:58,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:58,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160545036] [2022-02-21 03:39:58,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:58,993 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:58,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:58,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:58,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:58,994 INFO L87 Difference]: Start difference. First operand 2818 states and 4226 transitions. cyclomatic complexity: 1472 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:59,726 INFO L93 Difference]: Finished difference Result 5570 states and 8258 transitions. [2022-02-21 03:39:59,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:59,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:59,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:59,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8258 transitions. [2022-02-21 03:40:00,510 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2022-02-21 03:40:01,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8258 transitions. [2022-02-21 03:40:01,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2022-02-21 03:40:01,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2022-02-21 03:40:01,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8258 transitions. [2022-02-21 03:40:01,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:40:01,258 INFO L681 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2022-02-21 03:40:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8258 transitions. [2022-02-21 03:40:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2022-02-21 03:40:01,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:40:01,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5570 states and 8258 transitions. Second operand has 5570 states, 5570 states have (on average 1.4825852782764812) internal successors, (8258), 5569 states have internal predecessors, (8258), 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:40:01,406 INFO L74 IsIncluded]: Start isIncluded. First operand 5570 states and 8258 transitions. Second operand has 5570 states, 5570 states have (on average 1.4825852782764812) internal successors, (8258), 5569 states have internal predecessors, (8258), 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:40:01,412 INFO L87 Difference]: Start difference. First operand 5570 states and 8258 transitions. Second operand has 5570 states, 5570 states have (on average 1.4825852782764812) internal successors, (8258), 5569 states have internal predecessors, (8258), 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:40:02,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:02,152 INFO L93 Difference]: Finished difference Result 5570 states and 8258 transitions. [2022-02-21 03:40:02,152 INFO L276 IsEmpty]: Start isEmpty. Operand 5570 states and 8258 transitions. [2022-02-21 03:40:02,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:40:02,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:40:02,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 5570 states, 5570 states have (on average 1.4825852782764812) internal successors, (8258), 5569 states have internal predecessors, (8258), 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 5570 states and 8258 transitions. [2022-02-21 03:40:02,169 INFO L87 Difference]: Start difference. First operand has 5570 states, 5570 states have (on average 1.4825852782764812) internal successors, (8258), 5569 states have internal predecessors, (8258), 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 5570 states and 8258 transitions. [2022-02-21 03:40:02,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:02,816 INFO L93 Difference]: Finished difference Result 5570 states and 8258 transitions. [2022-02-21 03:40:02,816 INFO L276 IsEmpty]: Start isEmpty. Operand 5570 states and 8258 transitions. [2022-02-21 03:40:02,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:40:02,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:40:02,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:40:02,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:40:02,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5570 states have (on average 1.4825852782764812) internal successors, (8258), 5569 states have internal predecessors, (8258), 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:40:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8258 transitions. [2022-02-21 03:40:03,488 INFO L704 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2022-02-21 03:40:03,488 INFO L587 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2022-02-21 03:40:03,488 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:40:03,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8258 transitions. [2022-02-21 03:40:03,528 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2022-02-21 03:40:03,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:40:03,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:40:03,529 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:40:03,529 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:40:03,529 INFO L791 eck$LassoCheckResult]: Stem: 28202#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(18, 2);call #Ultimate.allocInit(12, 3); 28190#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 28191#L225-1 [2022-02-21 03:40:03,530 INFO L793 eck$LassoCheckResult]: Loop: 28191#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 28391#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 28389#L93 assume !(0 != main_~p1~0#1); 28386#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 28382#L97-1 assume !(0 != main_~p3~0#1); 28375#L101-1 assume !(0 != main_~p4~0#1); 28367#L105-1 assume !(0 != main_~p5~0#1); 28362#L109-1 assume !(0 != main_~p6~0#1); 28355#L113-1 assume !(0 != main_~p7~0#1); 28347#L117-1 assume !(0 != main_~p8~0#1); 28339#L121-1 assume !(0 != main_~p9~0#1); 28334#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 28330#L129-1 assume !(0 != main_~p11~0#1); 28326#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 28322#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 28318#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 28314#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 28308#L149-1 assume !(0 != main_~p1~0#1); 28309#L155-1 assume 0 != main_~p2~0#1; 28442#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 28439#L160 assume !(0 != main_~p3~0#1); 28434#L165-1 assume !(0 != main_~p4~0#1); 28430#L170-1 assume !(0 != main_~p5~0#1); 28428#L175-1 assume !(0 != main_~p6~0#1); 28426#L180-1 assume !(0 != main_~p7~0#1); 28422#L185-1 assume !(0 != main_~p8~0#1); 28418#L190-1 assume !(0 != main_~p9~0#1); 28415#L195-1 assume !(0 != main_~p10~0#1); 28411#L200-1 assume !(0 != main_~p11~0#1); 28407#L205-1 assume !(0 != main_~p12~0#1); 28403#L210-1 assume !(0 != main_~p13~0#1); 28400#L215-1 assume 0 != main_~p14~0#1; 28398#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 28395#L220 assume !(0 != main_~p15~0#1); 28191#L225-1 [2022-02-21 03:40:03,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:40:03,531 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-02-21 03:40:03,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:40:03,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186304706] [2022-02-21 03:40:03,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:40:03,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:40:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:40:03,537 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:40:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:40:03,561 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:40:03,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:40:03,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1790533308, now seen corresponding path program 1 times [2022-02-21 03:40:03,561 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:40:03,562 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358570040] [2022-02-21 03:40:03,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:40:03,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:40:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:40:03,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {44858#true} assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {44858#true} is VALID [2022-02-21 03:40:03,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {44858#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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; {44858#true} is VALID [2022-02-21 03:40:03,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {44858#true} assume !(0 != main_~p1~0#1); {44858#true} is VALID [2022-02-21 03:40:03,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {44858#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {44858#true} is VALID [2022-02-21 03:40:03,605 INFO L290 TraceCheckUtils]: 4: Hoare triple {44858#true} assume !(0 != main_~p3~0#1); {44858#true} is VALID [2022-02-21 03:40:03,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {44858#true} assume !(0 != main_~p4~0#1); {44858#true} is VALID [2022-02-21 03:40:03,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {44858#true} assume !(0 != main_~p5~0#1); {44858#true} is VALID [2022-02-21 03:40:03,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {44858#true} assume !(0 != main_~p6~0#1); {44858#true} is VALID [2022-02-21 03:40:03,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {44858#true} assume !(0 != main_~p7~0#1); {44858#true} is VALID [2022-02-21 03:40:03,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {44858#true} assume !(0 != main_~p8~0#1); {44858#true} is VALID [2022-02-21 03:40:03,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {44858#true} assume !(0 != main_~p9~0#1); {44858#true} is VALID [2022-02-21 03:40:03,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {44858#true} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:03,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p11~0#1); {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:03,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:03,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:03,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:03,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:03,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p1~0#1); {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:03,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume 0 != main_~p2~0#1; {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:03,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:03,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p3~0#1); {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:03,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p4~0#1); {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:03,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p5~0#1); {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:03,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p6~0#1); {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:03,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p7~0#1); {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:03,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p8~0#1); {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:03,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p9~0#1); {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:03,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p10~0#1); {44859#false} is VALID [2022-02-21 03:40:03,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {44859#false} assume !(0 != main_~p11~0#1); {44859#false} is VALID [2022-02-21 03:40:03,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {44859#false} assume !(0 != main_~p12~0#1); {44859#false} is VALID [2022-02-21 03:40:03,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {44859#false} assume !(0 != main_~p13~0#1); {44859#false} is VALID [2022-02-21 03:40:03,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {44859#false} assume 0 != main_~p14~0#1; {44859#false} is VALID [2022-02-21 03:40:03,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {44859#false} assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; {44859#false} is VALID [2022-02-21 03:40:03,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {44859#false} assume !(0 != main_~p15~0#1); {44859#false} is VALID [2022-02-21 03:40:03,621 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:40:03,622 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:40:03,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358570040] [2022-02-21 03:40:03,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358570040] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:40:03,623 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:40:03,623 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:40:03,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125225163] [2022-02-21 03:40:03,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:40:03,624 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:40:03,624 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:40:03,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:40:03,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:40:03,626 INFO L87 Difference]: Start difference. First operand 5570 states and 8258 transitions. cyclomatic complexity: 2816 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:40:06,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:06,336 INFO L93 Difference]: Finished difference Result 11010 states and 16130 transitions. [2022-02-21 03:40:06,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:40:06,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:40:06,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:40:06,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16130 transitions. [2022-02-21 03:40:08,948 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2022-02-21 03:40:11,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16130 transitions. [2022-02-21 03:40:11,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2022-02-21 03:40:11,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2022-02-21 03:40:11,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16130 transitions. [2022-02-21 03:40:11,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:40:11,570 INFO L681 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2022-02-21 03:40:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16130 transitions. [2022-02-21 03:40:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2022-02-21 03:40:11,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:40:11,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11010 states and 16130 transitions. Second operand has 11010 states, 11010 states have (on average 1.4650317892824705) internal successors, (16130), 11009 states have internal predecessors, (16130), 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:40:11,726 INFO L74 IsIncluded]: Start isIncluded. First operand 11010 states and 16130 transitions. Second operand has 11010 states, 11010 states have (on average 1.4650317892824705) internal successors, (16130), 11009 states have internal predecessors, (16130), 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:40:11,740 INFO L87 Difference]: Start difference. First operand 11010 states and 16130 transitions. Second operand has 11010 states, 11010 states have (on average 1.4650317892824705) internal successors, (16130), 11009 states have internal predecessors, (16130), 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:40:14,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:14,287 INFO L93 Difference]: Finished difference Result 11010 states and 16130 transitions. [2022-02-21 03:40:14,287 INFO L276 IsEmpty]: Start isEmpty. Operand 11010 states and 16130 transitions. [2022-02-21 03:40:14,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:40:14,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:40:14,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 11010 states, 11010 states have (on average 1.4650317892824705) internal successors, (16130), 11009 states have internal predecessors, (16130), 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 11010 states and 16130 transitions. [2022-02-21 03:40:14,316 INFO L87 Difference]: Start difference. First operand has 11010 states, 11010 states have (on average 1.4650317892824705) internal successors, (16130), 11009 states have internal predecessors, (16130), 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 11010 states and 16130 transitions. [2022-02-21 03:40:16,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:16,955 INFO L93 Difference]: Finished difference Result 11010 states and 16130 transitions. [2022-02-21 03:40:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 11010 states and 16130 transitions. [2022-02-21 03:40:16,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:40:16,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:40:16,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:40:16,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:40:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11010 states, 11010 states have (on average 1.4650317892824705) internal successors, (16130), 11009 states have internal predecessors, (16130), 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:40:19,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16130 transitions. [2022-02-21 03:40:19,461 INFO L704 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2022-02-21 03:40:19,461 INFO L587 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2022-02-21 03:40:19,461 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:40:19,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16130 transitions. [2022-02-21 03:40:19,478 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2022-02-21 03:40:19,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:40:19,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:40:19,479 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:40:19,479 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:40:19,479 INFO L791 eck$LassoCheckResult]: Stem: 55924#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(18, 2);call #Ultimate.allocInit(12, 3); 55912#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 55913#L225-1 [2022-02-21 03:40:19,479 INFO L793 eck$LassoCheckResult]: Loop: 55913#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 56219#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 56217#L93 assume !(0 != main_~p1~0#1); 56216#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 56215#L97-1 assume !(0 != main_~p3~0#1); 56213#L101-1 assume !(0 != main_~p4~0#1); 56211#L105-1 assume !(0 != main_~p5~0#1); 56209#L109-1 assume !(0 != main_~p6~0#1); 56208#L113-1 assume !(0 != main_~p7~0#1); 56204#L117-1 assume !(0 != main_~p8~0#1); 56200#L121-1 assume !(0 != main_~p9~0#1); 56197#L125-1 assume !(0 != main_~p10~0#1); 56193#L129-1 assume !(0 != main_~p11~0#1); 56194#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 56185#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 56186#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 56177#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 56178#L149-1 assume !(0 != main_~p1~0#1); 56167#L155-1 assume 0 != main_~p2~0#1; 56168#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 56159#L160 assume !(0 != main_~p3~0#1); 56158#L165-1 assume !(0 != main_~p4~0#1); 56098#L170-1 assume !(0 != main_~p5~0#1); 56099#L175-1 assume !(0 != main_~p6~0#1); 56089#L180-1 assume !(0 != main_~p7~0#1); 56090#L185-1 assume !(0 != main_~p8~0#1); 56077#L190-1 assume !(0 != main_~p9~0#1); 56079#L195-1 assume !(0 != main_~p10~0#1); 56229#L200-1 assume !(0 != main_~p11~0#1); 56227#L205-1 assume !(0 != main_~p12~0#1); 56225#L210-1 assume !(0 != main_~p13~0#1); 56223#L215-1 assume 0 != main_~p14~0#1; 56222#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 56221#L220 assume !(0 != main_~p15~0#1); 55913#L225-1 [2022-02-21 03:40:19,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:40:19,480 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-02-21 03:40:19,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:40:19,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102584099] [2022-02-21 03:40:19,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:40:19,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:40:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:40:19,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:40:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:40:19,486 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:40:19,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:40:19,486 INFO L85 PathProgramCache]: Analyzing trace with hash 698995654, now seen corresponding path program 1 times [2022-02-21 03:40:19,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:40:19,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338452072] [2022-02-21 03:40:19,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:40:19,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:40:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:40:19,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {88906#true} assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {88906#true} is VALID [2022-02-21 03:40:19,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {88906#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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; {88906#true} is VALID [2022-02-21 03:40:19,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {88906#true} assume !(0 != main_~p1~0#1); {88906#true} is VALID [2022-02-21 03:40:19,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {88906#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {88906#true} is VALID [2022-02-21 03:40:19,499 INFO L290 TraceCheckUtils]: 4: Hoare triple {88906#true} assume !(0 != main_~p3~0#1); {88906#true} is VALID [2022-02-21 03:40:19,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {88906#true} assume !(0 != main_~p4~0#1); {88906#true} is VALID [2022-02-21 03:40:19,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {88906#true} assume !(0 != main_~p5~0#1); {88906#true} is VALID [2022-02-21 03:40:19,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {88906#true} assume !(0 != main_~p6~0#1); {88906#true} is VALID [2022-02-21 03:40:19,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {88906#true} assume !(0 != main_~p7~0#1); {88906#true} is VALID [2022-02-21 03:40:19,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {88906#true} assume !(0 != main_~p8~0#1); {88906#true} is VALID [2022-02-21 03:40:19,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {88906#true} assume !(0 != main_~p9~0#1); {88906#true} is VALID [2022-02-21 03:40:19,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {88906#true} assume !(0 != main_~p10~0#1); {88906#true} is VALID [2022-02-21 03:40:19,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {88906#true} assume !(0 != main_~p11~0#1); {88906#true} is VALID [2022-02-21 03:40:19,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {88906#true} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:19,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:19,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:19,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:19,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p1~0#1); {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:19,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume 0 != main_~p2~0#1; {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:19,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:19,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p3~0#1); {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:19,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p4~0#1); {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:19,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p5~0#1); {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:19,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p6~0#1); {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:19,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p7~0#1); {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:19,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p8~0#1); {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:19,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p9~0#1); {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:19,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p10~0#1); {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:19,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p11~0#1); {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:19,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p12~0#1); {88907#false} is VALID [2022-02-21 03:40:19,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {88907#false} assume !(0 != main_~p13~0#1); {88907#false} is VALID [2022-02-21 03:40:19,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {88907#false} assume 0 != main_~p14~0#1; {88907#false} is VALID [2022-02-21 03:40:19,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {88907#false} assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; {88907#false} is VALID [2022-02-21 03:40:19,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {88907#false} assume !(0 != main_~p15~0#1); {88907#false} is VALID [2022-02-21 03:40:19,505 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:40:19,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:40:19,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338452072] [2022-02-21 03:40:19,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338452072] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:40:19,505 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:40:19,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:40:19,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471758441] [2022-02-21 03:40:19,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:40:19,506 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:40:19,506 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:40:19,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:40:19,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:40:19,507 INFO L87 Difference]: Start difference. First operand 11010 states and 16130 transitions. cyclomatic complexity: 5376 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:40:29,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:29,592 INFO L93 Difference]: Finished difference Result 21762 states and 31490 transitions. [2022-02-21 03:40:29,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:40:29,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:40:29,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:40:29,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 31490 transitions. [2022-02-21 03:40:38,649 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2022-02-21 03:40:47,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 31490 transitions. [2022-02-21 03:40:47,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2022-02-21 03:40:47,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2022-02-21 03:40:47,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 31490 transitions. [2022-02-21 03:40:47,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:40:47,964 INFO L681 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2022-02-21 03:40:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 31490 transitions. [2022-02-21 03:40:48,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2022-02-21 03:40:48,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:40:48,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21762 states and 31490 transitions. Second operand has 21762 states, 21762 states have (on average 1.447017737340318) internal successors, (31490), 21761 states have internal predecessors, (31490), 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:40:48,257 INFO L74 IsIncluded]: Start isIncluded. First operand 21762 states and 31490 transitions. Second operand has 21762 states, 21762 states have (on average 1.447017737340318) internal successors, (31490), 21761 states have internal predecessors, (31490), 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:40:48,277 INFO L87 Difference]: Start difference. First operand 21762 states and 31490 transitions. Second operand has 21762 states, 21762 states have (on average 1.447017737340318) internal successors, (31490), 21761 states have internal predecessors, (31490), 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:40:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:57,848 INFO L93 Difference]: Finished difference Result 21762 states and 31490 transitions. [2022-02-21 03:40:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand 21762 states and 31490 transitions. [2022-02-21 03:40:57,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:40:57,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:40:57,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 21762 states, 21762 states have (on average 1.447017737340318) internal successors, (31490), 21761 states have internal predecessors, (31490), 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 21762 states and 31490 transitions. [2022-02-21 03:40:57,904 INFO L87 Difference]: Start difference. First operand has 21762 states, 21762 states have (on average 1.447017737340318) internal successors, (31490), 21761 states have internal predecessors, (31490), 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 21762 states and 31490 transitions. [2022-02-21 03:41:07,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:41:07,525 INFO L93 Difference]: Finished difference Result 21762 states and 31490 transitions. [2022-02-21 03:41:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 21762 states and 31490 transitions. [2022-02-21 03:41:07,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:41:07,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:41:07,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:41:07,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:41:07,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 21762 states have (on average 1.447017737340318) internal successors, (31490), 21761 states have internal predecessors, (31490), 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)