./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_12.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_12.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 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:39:15,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:39:15,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:39:16,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:39:16,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:39:16,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:39:16,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:39:16,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:39:16,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:39:16,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:39:16,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:39:16,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:39:16,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:39:16,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:39:16,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:39:16,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:39:16,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:39:16,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:39:16,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:39:16,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:39:16,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:39:16,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:39:16,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:39:16,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:39:16,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:39:16,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:39:16,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:39:16,049 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:39:16,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:39:16,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:39:16,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:39:16,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:39:16,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:39:16,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:39:16,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:39:16,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:39:16,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:39:16,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:39:16,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:39:16,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:39:16,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:39:16,059 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:16,087 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:39:16,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:39:16,088 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:39:16,088 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:39:16,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:39:16,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:39:16,089 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:39:16,090 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:39:16,090 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:39:16,090 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:39:16,091 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:39:16,091 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:39:16,091 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:39:16,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:39:16,092 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:39:16,092 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:39:16,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:39:16,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:39:16,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:39:16,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:39:16,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:39:16,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:39:16,093 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:39:16,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:39:16,094 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:39:16,094 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:39:16,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:39:16,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:39:16,094 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:39:16,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:39:16,095 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:39:16,096 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:39:16,096 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 -> 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d [2022-02-21 03:39:16,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:39:16,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:39:16,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:39:16,372 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:39:16,372 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:39:16,373 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_12.c [2022-02-21 03:39:16,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de74cb119/1aba1d7db24748a5b79ca427e3159181/FLAG20a72190d [2022-02-21 03:39:16,808 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:39:16,810 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2022-02-21 03:39:16,818 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de74cb119/1aba1d7db24748a5b79ca427e3159181/FLAG20a72190d [2022-02-21 03:39:17,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de74cb119/1aba1d7db24748a5b79ca427e3159181 [2022-02-21 03:39:17,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:39:17,245 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:39:17,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:39:17,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:39:17,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:39:17,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:39:17" (1/1) ... [2022-02-21 03:39:17,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e87b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:17, skipping insertion in model container [2022-02-21 03:39:17,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:39:17" (1/1) ... [2022-02-21 03:39:17,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:39:17,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:39:17,483 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_12.c[4591,4604] [2022-02-21 03:39:17,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:39:17,505 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:39:17,544 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_12.c[4591,4604] [2022-02-21 03:39:17,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:39:17,564 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:39:17,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:17 WrapperNode [2022-02-21 03:39:17,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:39:17,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:39:17,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:39:17,567 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:39:17,573 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:17" (1/1) ... [2022-02-21 03:39:17,587 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:17" (1/1) ... [2022-02-21 03:39:17,621 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 147 [2022-02-21 03:39:17,621 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:39:17,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:39:17,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:39:17,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:39:17,630 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:17" (1/1) ... [2022-02-21 03:39:17,631 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:17" (1/1) ... [2022-02-21 03:39:17,638 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:17" (1/1) ... [2022-02-21 03:39:17,638 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:17" (1/1) ... [2022-02-21 03:39:17,645 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:17" (1/1) ... [2022-02-21 03:39:17,654 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:17" (1/1) ... [2022-02-21 03:39:17,656 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:17" (1/1) ... [2022-02-21 03:39:17,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:39:17,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:39:17,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:39:17,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:39:17,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:17" (1/1) ... [2022-02-21 03:39:17,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:39:17,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:39:17,697 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:17,723 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:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:39:17,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:39:17,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:39:17,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:39:17,807 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:39:17,809 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:39:18,069 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:39:18,074 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:39:18,075 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:39:18,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:39:18 BoogieIcfgContainer [2022-02-21 03:39:18,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:39:18,083 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:39:18,084 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:39:18,087 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:39:18,088 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:18,088 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:39:17" (1/3) ... [2022-02-21 03:39:18,089 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73549015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:39:18, skipping insertion in model container [2022-02-21 03:39:18,089 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:18,089 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:17" (2/3) ... [2022-02-21 03:39:18,089 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73549015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:39:18, skipping insertion in model container [2022-02-21 03:39:18,089 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:18,090 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:39:18" (3/3) ... [2022-02-21 03:39:18,091 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_12.c [2022-02-21 03:39:18,137 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:39:18,137 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:39:18,137 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:39:18,138 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:39:18,138 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:39:18,138 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:39:18,139 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:39:18,139 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:39:18,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:39:18,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-02-21 03:39:18,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:18,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:18,193 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:18,193 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] [2022-02-21 03:39:18,193 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:39:18,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:39:18,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-02-21 03:39:18,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:18,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:18,212 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:18,212 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] [2022-02-21 03:39:18,218 INFO L791 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 7#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_~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_~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;havoc main_~cond~0#1; 34#L183-1true [2022-02-21 03:39:18,220 INFO L793 eck$LassoCheckResult]: Loop: 34#L183-1true assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 18#L49true 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; 35#L78true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 15#L78-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 13#L82-1true assume !(0 != main_~p3~0#1); 9#L86-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 36#L90-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 12#L94-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 20#L98-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 33#L102-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 16#L106-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 26#L110-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 42#L114-1true assume !(0 != main_~p11~0#1); 31#L118-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 14#L122-1true assume !(0 != main_~p1~0#1); 28#L128-1true assume !(0 != main_~p2~0#1); 5#L133-1true assume !(0 != main_~p3~0#1); 4#L138-1true assume !(0 != main_~p4~0#1); 27#L143-1true assume !(0 != main_~p5~0#1); 6#L148-1true assume !(0 != main_~p6~0#1); 22#L153-1true assume !(0 != main_~p7~0#1); 39#L158-1true assume !(0 != main_~p8~0#1); 24#L163-1true assume !(0 != main_~p9~0#1); 41#L168-1true assume !(0 != main_~p10~0#1); 19#L173-1true assume !(0 != main_~p11~0#1); 8#L178-1true assume !(0 != main_~p12~0#1); 34#L183-1true [2022-02-21 03:39:18,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:18,225 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:39:18,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:18,234 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781569122] [2022-02-21 03:39:18,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:18,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:18,312 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:18,340 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:18,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:18,343 INFO L85 PathProgramCache]: Analyzing trace with hash -819199544, now seen corresponding path program 1 times [2022-02-21 03:39:18,343 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:18,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143559351] [2022-02-21 03:39:18,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:18,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:18,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#true} assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {51#true} is VALID [2022-02-21 03:39:18,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#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; {51#true} is VALID [2022-02-21 03:39:18,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {51#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:18,432 INFO L290 TraceCheckUtils]: 3: Hoare triple {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:18,433 INFO L290 TraceCheckUtils]: 4: Hoare triple {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:18,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:18,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:18,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:18,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:18,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:18,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:18,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:18,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p11~0#1); {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:18,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:18,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {53#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {52#false} is VALID [2022-02-21 03:39:18,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {52#false} assume !(0 != main_~p2~0#1); {52#false} is VALID [2022-02-21 03:39:18,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {52#false} assume !(0 != main_~p3~0#1); {52#false} is VALID [2022-02-21 03:39:18,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {52#false} assume !(0 != main_~p4~0#1); {52#false} is VALID [2022-02-21 03:39:18,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {52#false} assume !(0 != main_~p5~0#1); {52#false} is VALID [2022-02-21 03:39:18,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {52#false} assume !(0 != main_~p6~0#1); {52#false} is VALID [2022-02-21 03:39:18,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {52#false} assume !(0 != main_~p7~0#1); {52#false} is VALID [2022-02-21 03:39:18,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {52#false} assume !(0 != main_~p8~0#1); {52#false} is VALID [2022-02-21 03:39:18,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {52#false} assume !(0 != main_~p9~0#1); {52#false} is VALID [2022-02-21 03:39:18,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {52#false} assume !(0 != main_~p10~0#1); {52#false} is VALID [2022-02-21 03:39:18,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {52#false} assume !(0 != main_~p11~0#1); {52#false} is VALID [2022-02-21 03:39:18,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {52#false} assume !(0 != main_~p12~0#1); {52#false} is VALID [2022-02-21 03:39:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:39:18,443 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:18,443 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143559351] [2022-02-21 03:39:18,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143559351] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:18,444 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:18,444 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:18,444 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135350784] [2022-02-21 03:39:18,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:18,448 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:18,449 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:18,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:18,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:18,472 INFO L87 Difference]: Start difference. First operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 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 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:39:18,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:18,699 INFO L93 Difference]: Finished difference Result 87 states and 154 transitions. [2022-02-21 03:39:18,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:18,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:39:18,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:18,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 154 transitions. [2022-02-21 03:39:18,759 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2022-02-21 03:39:18,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 77 states and 123 transitions. [2022-02-21 03:39:18,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2022-02-21 03:39:18,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2022-02-21 03:39:18,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 123 transitions. [2022-02-21 03:39:18,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:18,768 INFO L681 BuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2022-02-21 03:39:18,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 123 transitions. [2022-02-21 03:39:18,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-02-21 03:39:18,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:18,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states and 123 transitions. Second operand has 77 states, 77 states have (on average 1.5974025974025974) internal successors, (123), 76 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:39:18,795 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states and 123 transitions. Second operand has 77 states, 77 states have (on average 1.5974025974025974) internal successors, (123), 76 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:39:18,797 INFO L87 Difference]: Start difference. First operand 77 states and 123 transitions. Second operand has 77 states, 77 states have (on average 1.5974025974025974) internal successors, (123), 76 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:39:18,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:18,803 INFO L93 Difference]: Finished difference Result 77 states and 123 transitions. [2022-02-21 03:39:18,804 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 123 transitions. [2022-02-21 03:39:18,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:18,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:18,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 77 states have (on average 1.5974025974025974) internal successors, (123), 76 states have internal predecessors, (123), 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 77 states and 123 transitions. [2022-02-21 03:39:18,807 INFO L87 Difference]: Start difference. First operand has 77 states, 77 states have (on average 1.5974025974025974) internal successors, (123), 76 states have internal predecessors, (123), 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 77 states and 123 transitions. [2022-02-21 03:39:18,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:18,813 INFO L93 Difference]: Finished difference Result 77 states and 123 transitions. [2022-02-21 03:39:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 123 transitions. [2022-02-21 03:39:18,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:18,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:18,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:18,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:18,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.5974025974025974) internal successors, (123), 76 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:39:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 123 transitions. [2022-02-21 03:39:18,821 INFO L704 BuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2022-02-21 03:39:18,822 INFO L587 BuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2022-02-21 03:39:18,822 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:39:18,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 123 transitions. [2022-02-21 03:39:18,823 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2022-02-21 03:39:18,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:18,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:18,824 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:18,824 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] [2022-02-21 03:39:18,825 INFO L791 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 152#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_~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_~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;havoc main_~cond~0#1; 151#L183-1 [2022-02-21 03:39:18,825 INFO L793 eck$LassoCheckResult]: Loop: 151#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 167#L49 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; 168#L78 assume !(0 != main_~p1~0#1); 196#L78-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 195#L82-1 assume !(0 != main_~p3~0#1); 153#L86-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 154#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 194#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 193#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 192#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 191#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 190#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 187#L114-1 assume !(0 != main_~p11~0#1); 188#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 189#L122-1 assume !(0 != main_~p1~0#1); 179#L128-1 assume !(0 != main_~p2~0#1); 144#L133-1 assume !(0 != main_~p3~0#1); 141#L138-1 assume !(0 != main_~p4~0#1); 142#L143-1 assume !(0 != main_~p5~0#1); 146#L148-1 assume !(0 != main_~p6~0#1); 148#L153-1 assume !(0 != main_~p7~0#1); 156#L158-1 assume !(0 != main_~p8~0#1); 205#L163-1 assume !(0 != main_~p9~0#1); 185#L168-1 assume !(0 != main_~p10~0#1); 169#L173-1 assume !(0 != main_~p11~0#1); 149#L178-1 assume !(0 != main_~p12~0#1); 151#L183-1 [2022-02-21 03:39:18,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:18,826 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:39:18,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:18,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965598981] [2022-02-21 03:39:18,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:18,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:18,833 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:18,840 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:18,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:18,841 INFO L85 PathProgramCache]: Analyzing trace with hash -953213050, now seen corresponding path program 1 times [2022-02-21 03:39:18,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:18,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816134397] [2022-02-21 03:39:18,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:18,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:18,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#true} assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {377#true} is VALID [2022-02-21 03:39:18,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#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; {377#true} is VALID [2022-02-21 03:39:18,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume !(0 != main_~p1~0#1); {377#true} is VALID [2022-02-21 03:39:18,879 INFO L290 TraceCheckUtils]: 3: Hoare triple {377#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:18,879 INFO L290 TraceCheckUtils]: 4: Hoare triple {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:18,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:18,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:18,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:18,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:18,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:18,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:18,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:18,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p11~0#1); {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:18,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:18,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:18,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {379#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {378#false} is VALID [2022-02-21 03:39:18,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {378#false} assume !(0 != main_~p3~0#1); {378#false} is VALID [2022-02-21 03:39:18,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {378#false} assume !(0 != main_~p4~0#1); {378#false} is VALID [2022-02-21 03:39:18,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {378#false} assume !(0 != main_~p5~0#1); {378#false} is VALID [2022-02-21 03:39:18,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {378#false} assume !(0 != main_~p6~0#1); {378#false} is VALID [2022-02-21 03:39:18,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {378#false} assume !(0 != main_~p7~0#1); {378#false} is VALID [2022-02-21 03:39:18,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {378#false} assume !(0 != main_~p8~0#1); {378#false} is VALID [2022-02-21 03:39:18,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {378#false} assume !(0 != main_~p9~0#1); {378#false} is VALID [2022-02-21 03:39:18,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {378#false} assume !(0 != main_~p10~0#1); {378#false} is VALID [2022-02-21 03:39:18,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {378#false} assume !(0 != main_~p11~0#1); {378#false} is VALID [2022-02-21 03:39:18,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {378#false} assume !(0 != main_~p12~0#1); {378#false} is VALID [2022-02-21 03:39:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:39:18,892 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:18,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816134397] [2022-02-21 03:39:18,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816134397] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:18,893 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:18,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:18,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494591462] [2022-02-21 03:39:18,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:18,894 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:18,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:18,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:18,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:18,895 INFO L87 Difference]: Start difference. First operand 77 states and 123 transitions. cyclomatic complexity: 48 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:19,048 INFO L93 Difference]: Finished difference Result 150 states and 238 transitions. [2022-02-21 03:39:19,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:19,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:19,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:19,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 238 transitions. [2022-02-21 03:39:19,095 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2022-02-21 03:39:19,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 238 transitions. [2022-02-21 03:39:19,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2022-02-21 03:39:19,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2022-02-21 03:39:19,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 238 transitions. [2022-02-21 03:39:19,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:19,108 INFO L681 BuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2022-02-21 03:39:19,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 238 transitions. [2022-02-21 03:39:19,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-02-21 03:39:19,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:19,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states and 238 transitions. Second operand has 150 states, 150 states have (on average 1.5866666666666667) internal successors, (238), 149 states have internal predecessors, (238), 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:19,128 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states and 238 transitions. Second operand has 150 states, 150 states have (on average 1.5866666666666667) internal successors, (238), 149 states have internal predecessors, (238), 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:19,130 INFO L87 Difference]: Start difference. First operand 150 states and 238 transitions. Second operand has 150 states, 150 states have (on average 1.5866666666666667) internal successors, (238), 149 states have internal predecessors, (238), 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:19,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:19,138 INFO L93 Difference]: Finished difference Result 150 states and 238 transitions. [2022-02-21 03:39:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 238 transitions. [2022-02-21 03:39:19,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:19,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:19,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 150 states have (on average 1.5866666666666667) internal successors, (238), 149 states have internal predecessors, (238), 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 150 states and 238 transitions. [2022-02-21 03:39:19,144 INFO L87 Difference]: Start difference. First operand has 150 states, 150 states have (on average 1.5866666666666667) internal successors, (238), 149 states have internal predecessors, (238), 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 150 states and 238 transitions. [2022-02-21 03:39:19,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:19,150 INFO L93 Difference]: Finished difference Result 150 states and 238 transitions. [2022-02-21 03:39:19,150 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 238 transitions. [2022-02-21 03:39:19,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:19,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:19,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:19,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 1.5866666666666667) internal successors, (238), 149 states have internal predecessors, (238), 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:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 238 transitions. [2022-02-21 03:39:19,157 INFO L704 BuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2022-02-21 03:39:19,157 INFO L587 BuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2022-02-21 03:39:19,157 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:39:19,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 238 transitions. [2022-02-21 03:39:19,159 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2022-02-21 03:39:19,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:19,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:19,159 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:19,160 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] [2022-02-21 03:39:19,160 INFO L791 eck$LassoCheckResult]: Stem: 568#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 541#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_~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_~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;havoc main_~cond~0#1; 540#L183-1 [2022-02-21 03:39:19,160 INFO L793 eck$LassoCheckResult]: Loop: 540#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 577#L49 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; 605#L78 assume !(0 != main_~p1~0#1); 606#L78-2 assume !(0 != main_~p2~0#1); 665#L82-1 assume !(0 != main_~p3~0#1); 542#L86-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 543#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 597#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 598#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 575#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 576#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 589#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 590#L114-1 assume !(0 != main_~p11~0#1); 588#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 586#L122-1 assume !(0 != main_~p1~0#1); 587#L128-1 assume !(0 != main_~p2~0#1); 533#L133-1 assume !(0 != main_~p3~0#1); 530#L138-1 assume !(0 != main_~p4~0#1); 531#L143-1 assume !(0 != main_~p5~0#1); 571#L148-1 assume !(0 != main_~p6~0#1); 636#L153-1 assume !(0 != main_~p7~0#1); 634#L158-1 assume !(0 != main_~p8~0#1); 632#L163-1 assume !(0 != main_~p9~0#1); 631#L168-1 assume !(0 != main_~p10~0#1); 666#L173-1 assume !(0 != main_~p11~0#1); 538#L178-1 assume !(0 != main_~p12~0#1); 540#L183-1 [2022-02-21 03:39:19,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:19,160 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-02-21 03:39:19,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:19,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124247224] [2022-02-21 03:39:19,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:19,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:19,170 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:19,176 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:19,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:19,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1536315912, now seen corresponding path program 1 times [2022-02-21 03:39:19,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:19,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820927655] [2022-02-21 03:39:19,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:19,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:19,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {985#true} assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {985#true} is VALID [2022-02-21 03:39:19,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {985#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; {985#true} is VALID [2022-02-21 03:39:19,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {985#true} assume !(0 != main_~p1~0#1); {985#true} is VALID [2022-02-21 03:39:19,250 INFO L290 TraceCheckUtils]: 3: Hoare triple {985#true} assume !(0 != main_~p2~0#1); {985#true} is VALID [2022-02-21 03:39:19,250 INFO L290 TraceCheckUtils]: 4: Hoare triple {985#true} assume !(0 != main_~p3~0#1); {985#true} is VALID [2022-02-21 03:39:19,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {985#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:19,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:19,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:19,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:19,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:19,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:19,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:19,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p11~0#1); {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:19,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:19,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:19,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:19,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:19,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {987#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {986#false} is VALID [2022-02-21 03:39:19,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {986#false} assume !(0 != main_~p5~0#1); {986#false} is VALID [2022-02-21 03:39:19,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {986#false} assume !(0 != main_~p6~0#1); {986#false} is VALID [2022-02-21 03:39:19,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {986#false} assume !(0 != main_~p7~0#1); {986#false} is VALID [2022-02-21 03:39:19,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {986#false} assume !(0 != main_~p8~0#1); {986#false} is VALID [2022-02-21 03:39:19,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {986#false} assume !(0 != main_~p9~0#1); {986#false} is VALID [2022-02-21 03:39:19,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {986#false} assume !(0 != main_~p10~0#1); {986#false} is VALID [2022-02-21 03:39:19,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {986#false} assume !(0 != main_~p11~0#1); {986#false} is VALID [2022-02-21 03:39:19,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {986#false} assume !(0 != main_~p12~0#1); {986#false} is VALID [2022-02-21 03:39:19,263 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:19,263 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:19,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820927655] [2022-02-21 03:39:19,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820927655] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:19,264 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:19,264 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:19,264 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148643534] [2022-02-21 03:39:19,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:19,266 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:19,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:19,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:19,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:19,269 INFO L87 Difference]: Start difference. First operand 150 states and 238 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:19,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:19,376 INFO L93 Difference]: Finished difference Result 294 states and 462 transitions. [2022-02-21 03:39:19,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:19,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:19,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:19,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 462 transitions. [2022-02-21 03:39:19,420 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2022-02-21 03:39:19,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 294 states and 462 transitions. [2022-02-21 03:39:19,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2022-02-21 03:39:19,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2022-02-21 03:39:19,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 294 states and 462 transitions. [2022-02-21 03:39:19,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:19,431 INFO L681 BuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2022-02-21 03:39:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states and 462 transitions. [2022-02-21 03:39:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-02-21 03:39:19,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:19,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 294 states and 462 transitions. Second operand has 294 states, 294 states have (on average 1.5714285714285714) internal successors, (462), 293 states have internal predecessors, (462), 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:19,442 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states and 462 transitions. Second operand has 294 states, 294 states have (on average 1.5714285714285714) internal successors, (462), 293 states have internal predecessors, (462), 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:19,443 INFO L87 Difference]: Start difference. First operand 294 states and 462 transitions. Second operand has 294 states, 294 states have (on average 1.5714285714285714) internal successors, (462), 293 states have internal predecessors, (462), 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:19,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:19,451 INFO L93 Difference]: Finished difference Result 294 states and 462 transitions. [2022-02-21 03:39:19,451 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 462 transitions. [2022-02-21 03:39:19,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:19,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:19,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 294 states, 294 states have (on average 1.5714285714285714) internal successors, (462), 293 states have internal predecessors, (462), 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 294 states and 462 transitions. [2022-02-21 03:39:19,453 INFO L87 Difference]: Start difference. First operand has 294 states, 294 states have (on average 1.5714285714285714) internal successors, (462), 293 states have internal predecessors, (462), 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 294 states and 462 transitions. [2022-02-21 03:39:19,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:19,464 INFO L93 Difference]: Finished difference Result 294 states and 462 transitions. [2022-02-21 03:39:19,464 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 462 transitions. [2022-02-21 03:39:19,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:19,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:19,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:19,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 294 states have (on average 1.5714285714285714) internal successors, (462), 293 states have internal predecessors, (462), 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:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 462 transitions. [2022-02-21 03:39:19,476 INFO L704 BuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2022-02-21 03:39:19,476 INFO L587 BuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2022-02-21 03:39:19,476 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:39:19,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 294 states and 462 transitions. [2022-02-21 03:39:19,479 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2022-02-21 03:39:19,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:19,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:19,480 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:19,480 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] [2022-02-21 03:39:19,481 INFO L791 eck$LassoCheckResult]: Stem: 1322#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1292#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_~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_~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;havoc main_~cond~0#1; 1293#L183-1 [2022-02-21 03:39:19,482 INFO L793 eck$LassoCheckResult]: Loop: 1293#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1403#L49 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; 1397#L78 assume !(0 != main_~p1~0#1); 1398#L78-2 assume !(0 != main_~p2~0#1); 1485#L82-1 assume !(0 != main_~p3~0#1); 1480#L86-1 assume !(0 != main_~p4~0#1); 1477#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1473#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1469#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1465#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1461#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1457#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1453#L114-1 assume !(0 != main_~p11~0#1); 1447#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1399#L122-1 assume !(0 != main_~p1~0#1); 1400#L128-1 assume !(0 != main_~p2~0#1); 1443#L133-1 assume !(0 != main_~p3~0#1); 1439#L138-1 assume !(0 != main_~p4~0#1); 1436#L143-1 assume !(0 != main_~p5~0#1); 1432#L148-1 assume !(0 != main_~p6~0#1); 1428#L153-1 assume !(0 != main_~p7~0#1); 1424#L158-1 assume !(0 != main_~p8~0#1); 1420#L163-1 assume !(0 != main_~p9~0#1); 1416#L168-1 assume !(0 != main_~p10~0#1); 1411#L173-1 assume !(0 != main_~p11~0#1); 1408#L178-1 assume !(0 != main_~p12~0#1); 1293#L183-1 [2022-02-21 03:39:19,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-02-21 03:39:19,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:19,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227055282] [2022-02-21 03:39:19,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:19,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:19,494 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:19,500 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:19,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:19,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1959017738, now seen corresponding path program 1 times [2022-02-21 03:39:19,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:19,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023858111] [2022-02-21 03:39:19,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:19,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:19,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {2169#true} assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {2169#true} is VALID [2022-02-21 03:39:19,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {2169#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; {2169#true} is VALID [2022-02-21 03:39:19,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {2169#true} assume !(0 != main_~p1~0#1); {2169#true} is VALID [2022-02-21 03:39:19,530 INFO L290 TraceCheckUtils]: 3: Hoare triple {2169#true} assume !(0 != main_~p2~0#1); {2169#true} is VALID [2022-02-21 03:39:19,531 INFO L290 TraceCheckUtils]: 4: Hoare triple {2169#true} assume !(0 != main_~p3~0#1); {2169#true} is VALID [2022-02-21 03:39:19,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {2169#true} assume !(0 != main_~p4~0#1); {2169#true} is VALID [2022-02-21 03:39:19,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {2169#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:19,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:19,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:19,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:19,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:19,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:19,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p11~0#1); {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:19,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:19,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:19,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:19,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:19,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:19,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {2171#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {2170#false} is VALID [2022-02-21 03:39:19,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {2170#false} assume !(0 != main_~p6~0#1); {2170#false} is VALID [2022-02-21 03:39:19,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {2170#false} assume !(0 != main_~p7~0#1); {2170#false} is VALID [2022-02-21 03:39:19,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {2170#false} assume !(0 != main_~p8~0#1); {2170#false} is VALID [2022-02-21 03:39:19,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {2170#false} assume !(0 != main_~p9~0#1); {2170#false} is VALID [2022-02-21 03:39:19,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {2170#false} assume !(0 != main_~p10~0#1); {2170#false} is VALID [2022-02-21 03:39:19,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {2170#false} assume !(0 != main_~p11~0#1); {2170#false} is VALID [2022-02-21 03:39:19,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {2170#false} assume !(0 != main_~p12~0#1); {2170#false} is VALID [2022-02-21 03:39:19,538 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:19,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:19,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023858111] [2022-02-21 03:39:19,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023858111] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:19,539 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:19,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:19,540 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662975283] [2022-02-21 03:39:19,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:19,540 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:19,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:19,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:19,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:19,541 INFO L87 Difference]: Start difference. First operand 294 states and 462 transitions. cyclomatic complexity: 176 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:19,640 INFO L93 Difference]: Finished difference Result 578 states and 898 transitions. [2022-02-21 03:39:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:19,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:19,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:19,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 578 states and 898 transitions. [2022-02-21 03:39:19,697 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2022-02-21 03:39:19,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 578 states to 578 states and 898 transitions. [2022-02-21 03:39:19,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 578 [2022-02-21 03:39:19,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 578 [2022-02-21 03:39:19,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 578 states and 898 transitions. [2022-02-21 03:39:19,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:19,717 INFO L681 BuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2022-02-21 03:39:19,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states and 898 transitions. [2022-02-21 03:39:19,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2022-02-21 03:39:19,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:19,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 578 states and 898 transitions. Second operand has 578 states, 578 states have (on average 1.5536332179930796) internal successors, (898), 577 states have internal predecessors, (898), 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:19,744 INFO L74 IsIncluded]: Start isIncluded. First operand 578 states and 898 transitions. Second operand has 578 states, 578 states have (on average 1.5536332179930796) internal successors, (898), 577 states have internal predecessors, (898), 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:19,745 INFO L87 Difference]: Start difference. First operand 578 states and 898 transitions. Second operand has 578 states, 578 states have (on average 1.5536332179930796) internal successors, (898), 577 states have internal predecessors, (898), 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:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:19,762 INFO L93 Difference]: Finished difference Result 578 states and 898 transitions. [2022-02-21 03:39:19,762 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 898 transitions. [2022-02-21 03:39:19,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:19,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:19,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 578 states, 578 states have (on average 1.5536332179930796) internal successors, (898), 577 states have internal predecessors, (898), 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 578 states and 898 transitions. [2022-02-21 03:39:19,766 INFO L87 Difference]: Start difference. First operand has 578 states, 578 states have (on average 1.5536332179930796) internal successors, (898), 577 states have internal predecessors, (898), 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 578 states and 898 transitions. [2022-02-21 03:39:19,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:19,783 INFO L93 Difference]: Finished difference Result 578 states and 898 transitions. [2022-02-21 03:39:19,783 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 898 transitions. [2022-02-21 03:39:19,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:19,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:19,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:19,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 578 states have (on average 1.5536332179930796) internal successors, (898), 577 states have internal predecessors, (898), 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:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 898 transitions. [2022-02-21 03:39:19,804 INFO L704 BuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2022-02-21 03:39:19,804 INFO L587 BuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2022-02-21 03:39:19,804 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:39:19,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 578 states and 898 transitions. [2022-02-21 03:39:19,807 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2022-02-21 03:39:19,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:19,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:19,808 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:19,808 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] [2022-02-21 03:39:19,809 INFO L791 eck$LassoCheckResult]: Stem: 2790#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 2758#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_~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_~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;havoc main_~cond~0#1; 2759#L183-1 [2022-02-21 03:39:19,809 INFO L793 eck$LassoCheckResult]: Loop: 2759#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2992#L49 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; 2991#L78 assume !(0 != main_~p1~0#1); 2988#L78-2 assume !(0 != main_~p2~0#1); 2981#L82-1 assume !(0 != main_~p3~0#1); 2982#L86-1 assume !(0 != main_~p4~0#1); 2963#L90-1 assume !(0 != main_~p5~0#1); 2965#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 2947#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2948#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2931#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2932#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2915#L114-1 assume !(0 != main_~p11~0#1); 2916#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2899#L122-1 assume !(0 != main_~p1~0#1); 2900#L128-1 assume !(0 != main_~p2~0#1); 3020#L133-1 assume !(0 != main_~p3~0#1); 3017#L138-1 assume !(0 != main_~p4~0#1); 3014#L143-1 assume !(0 != main_~p5~0#1); 3013#L148-1 assume !(0 != main_~p6~0#1); 3011#L153-1 assume !(0 != main_~p7~0#1); 3009#L158-1 assume !(0 != main_~p8~0#1); 3006#L163-1 assume !(0 != main_~p9~0#1); 3003#L168-1 assume !(0 != main_~p10~0#1); 2996#L173-1 assume !(0 != main_~p11~0#1); 2994#L178-1 assume !(0 != main_~p12~0#1); 2759#L183-1 [2022-02-21 03:39:19,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:19,810 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-02-21 03:39:19,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:19,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878350496] [2022-02-21 03:39:19,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:19,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:19,826 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:19,832 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:19,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:19,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1141369288, now seen corresponding path program 1 times [2022-02-21 03:39:19,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:19,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036429953] [2022-02-21 03:39:19,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:19,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:19,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {4489#true} assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {4489#true} is VALID [2022-02-21 03:39:19,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {4489#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; {4489#true} is VALID [2022-02-21 03:39:19,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {4489#true} assume !(0 != main_~p1~0#1); {4489#true} is VALID [2022-02-21 03:39:19,861 INFO L290 TraceCheckUtils]: 3: Hoare triple {4489#true} assume !(0 != main_~p2~0#1); {4489#true} is VALID [2022-02-21 03:39:19,861 INFO L290 TraceCheckUtils]: 4: Hoare triple {4489#true} assume !(0 != main_~p3~0#1); {4489#true} is VALID [2022-02-21 03:39:19,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {4489#true} assume !(0 != main_~p4~0#1); {4489#true} is VALID [2022-02-21 03:39:19,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {4489#true} assume !(0 != main_~p5~0#1); {4489#true} is VALID [2022-02-21 03:39:19,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {4489#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:19,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:19,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:19,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:19,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:19,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p11~0#1); {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:19,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:19,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:19,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p2~0#1); {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:19,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:19,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:19,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:19,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {4491#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {4490#false} is VALID [2022-02-21 03:39:19,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {4490#false} assume !(0 != main_~p7~0#1); {4490#false} is VALID [2022-02-21 03:39:19,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {4490#false} assume !(0 != main_~p8~0#1); {4490#false} is VALID [2022-02-21 03:39:19,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {4490#false} assume !(0 != main_~p9~0#1); {4490#false} is VALID [2022-02-21 03:39:19,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {4490#false} assume !(0 != main_~p10~0#1); {4490#false} is VALID [2022-02-21 03:39:19,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {4490#false} assume !(0 != main_~p11~0#1); {4490#false} is VALID [2022-02-21 03:39:19,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {4490#false} assume !(0 != main_~p12~0#1); {4490#false} is VALID [2022-02-21 03:39:19,870 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:19,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:19,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036429953] [2022-02-21 03:39:19,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036429953] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:19,871 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:19,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:19,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986960490] [2022-02-21 03:39:19,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:19,872 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:19,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:19,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:19,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:19,873 INFO L87 Difference]: Start difference. First operand 578 states and 898 transitions. cyclomatic complexity: 336 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:19,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:20,003 INFO L93 Difference]: Finished difference Result 1138 states and 1746 transitions. [2022-02-21 03:39:20,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:20,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:20,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:20,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1138 states and 1746 transitions. [2022-02-21 03:39:20,085 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2022-02-21 03:39:20,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1138 states to 1138 states and 1746 transitions. [2022-02-21 03:39:20,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1138 [2022-02-21 03:39:20,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1138 [2022-02-21 03:39:20,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1138 states and 1746 transitions. [2022-02-21 03:39:20,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:20,141 INFO L681 BuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2022-02-21 03:39:20,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states and 1746 transitions. [2022-02-21 03:39:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2022-02-21 03:39:20,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:20,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1138 states and 1746 transitions. Second operand has 1138 states, 1138 states have (on average 1.5342706502636203) internal successors, (1746), 1137 states have internal predecessors, (1746), 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:20,162 INFO L74 IsIncluded]: Start isIncluded. First operand 1138 states and 1746 transitions. Second operand has 1138 states, 1138 states have (on average 1.5342706502636203) internal successors, (1746), 1137 states have internal predecessors, (1746), 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:20,165 INFO L87 Difference]: Start difference. First operand 1138 states and 1746 transitions. Second operand has 1138 states, 1138 states have (on average 1.5342706502636203) internal successors, (1746), 1137 states have internal predecessors, (1746), 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:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:20,213 INFO L93 Difference]: Finished difference Result 1138 states and 1746 transitions. [2022-02-21 03:39:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1746 transitions. [2022-02-21 03:39:20,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:20,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:20,218 INFO L74 IsIncluded]: Start isIncluded. First operand has 1138 states, 1138 states have (on average 1.5342706502636203) internal successors, (1746), 1137 states have internal predecessors, (1746), 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 1138 states and 1746 transitions. [2022-02-21 03:39:20,220 INFO L87 Difference]: Start difference. First operand has 1138 states, 1138 states have (on average 1.5342706502636203) internal successors, (1746), 1137 states have internal predecessors, (1746), 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 1138 states and 1746 transitions. [2022-02-21 03:39:20,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:20,271 INFO L93 Difference]: Finished difference Result 1138 states and 1746 transitions. [2022-02-21 03:39:20,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1746 transitions. [2022-02-21 03:39:20,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:20,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:20,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:20,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1138 states have (on average 1.5342706502636203) internal successors, (1746), 1137 states have internal predecessors, (1746), 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:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1746 transitions. [2022-02-21 03:39:20,324 INFO L704 BuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2022-02-21 03:39:20,324 INFO L587 BuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2022-02-21 03:39:20,325 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:39:20,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1138 states and 1746 transitions. [2022-02-21 03:39:20,330 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2022-02-21 03:39:20,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:20,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:20,331 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:20,331 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] [2022-02-21 03:39:20,331 INFO L791 eck$LassoCheckResult]: Stem: 5666#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 5636#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_~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_~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;havoc main_~cond~0#1; 5637#L183-1 [2022-02-21 03:39:20,332 INFO L793 eck$LassoCheckResult]: Loop: 5637#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 5871#L49 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; 5867#L78 assume !(0 != main_~p1~0#1); 5864#L78-2 assume !(0 != main_~p2~0#1); 5856#L82-1 assume !(0 != main_~p3~0#1); 5857#L86-1 assume !(0 != main_~p4~0#1); 5836#L90-1 assume !(0 != main_~p5~0#1); 5838#L94-1 assume !(0 != main_~p6~0#1); 5820#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 5821#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 5804#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 5805#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 5788#L114-1 assume !(0 != main_~p11~0#1); 5789#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 5768#L122-1 assume !(0 != main_~p1~0#1); 5769#L128-1 assume !(0 != main_~p2~0#1); 5905#L133-1 assume !(0 != main_~p3~0#1); 5902#L138-1 assume !(0 != main_~p4~0#1); 5900#L143-1 assume !(0 != main_~p5~0#1); 5898#L148-1 assume !(0 != main_~p6~0#1); 5895#L153-1 assume !(0 != main_~p7~0#1); 5891#L158-1 assume !(0 != main_~p8~0#1); 5887#L163-1 assume !(0 != main_~p9~0#1); 5883#L168-1 assume !(0 != main_~p10~0#1); 5878#L173-1 assume !(0 != main_~p11~0#1); 5875#L178-1 assume !(0 != main_~p12~0#1); 5637#L183-1 [2022-02-21 03:39:20,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:20,332 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-02-21 03:39:20,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:20,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177408833] [2022-02-21 03:39:20,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:20,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:20,339 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:20,354 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:20,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:20,354 INFO L85 PathProgramCache]: Analyzing trace with hash -547574454, now seen corresponding path program 1 times [2022-02-21 03:39:20,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:20,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026778594] [2022-02-21 03:39:20,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:20,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:20,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {9049#true} assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {9049#true} is VALID [2022-02-21 03:39:20,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {9049#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; {9049#true} is VALID [2022-02-21 03:39:20,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {9049#true} assume !(0 != main_~p1~0#1); {9049#true} is VALID [2022-02-21 03:39:20,378 INFO L290 TraceCheckUtils]: 3: Hoare triple {9049#true} assume !(0 != main_~p2~0#1); {9049#true} is VALID [2022-02-21 03:39:20,378 INFO L290 TraceCheckUtils]: 4: Hoare triple {9049#true} assume !(0 != main_~p3~0#1); {9049#true} is VALID [2022-02-21 03:39:20,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {9049#true} assume !(0 != main_~p4~0#1); {9049#true} is VALID [2022-02-21 03:39:20,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {9049#true} assume !(0 != main_~p5~0#1); {9049#true} is VALID [2022-02-21 03:39:20,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {9049#true} assume !(0 != main_~p6~0#1); {9049#true} is VALID [2022-02-21 03:39:20,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {9049#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:20,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:20,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:20,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:20,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p11~0#1); {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:20,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:20,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p1~0#1); {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:20,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p2~0#1); {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:20,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p3~0#1); {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:20,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p4~0#1); {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:20,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p5~0#1); {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:20,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p6~0#1); {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:20,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {9051#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p7~0#1); {9050#false} is VALID [2022-02-21 03:39:20,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {9050#false} assume !(0 != main_~p8~0#1); {9050#false} is VALID [2022-02-21 03:39:20,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {9050#false} assume !(0 != main_~p9~0#1); {9050#false} is VALID [2022-02-21 03:39:20,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {9050#false} assume !(0 != main_~p10~0#1); {9050#false} is VALID [2022-02-21 03:39:20,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {9050#false} assume !(0 != main_~p11~0#1); {9050#false} is VALID [2022-02-21 03:39:20,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {9050#false} assume !(0 != main_~p12~0#1); {9050#false} is VALID [2022-02-21 03:39:20,386 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:20,386 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:20,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026778594] [2022-02-21 03:39:20,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026778594] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:20,386 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:20,386 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:20,387 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853035200] [2022-02-21 03:39:20,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:20,387 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:20,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:20,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:20,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:20,388 INFO L87 Difference]: Start difference. First operand 1138 states and 1746 transitions. cyclomatic complexity: 640 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:20,641 INFO L93 Difference]: Finished difference Result 2242 states and 3394 transitions. [2022-02-21 03:39:20,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:20,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:20,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:20,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2242 states and 3394 transitions. [2022-02-21 03:39:20,855 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2022-02-21 03:39:21,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2242 states to 2242 states and 3394 transitions. [2022-02-21 03:39:21,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2242 [2022-02-21 03:39:21,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2242 [2022-02-21 03:39:21,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2242 states and 3394 transitions. [2022-02-21 03:39:21,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:21,034 INFO L681 BuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2022-02-21 03:39:21,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states and 3394 transitions. [2022-02-21 03:39:21,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2242. [2022-02-21 03:39:21,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:21,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2242 states and 3394 transitions. Second operand has 2242 states, 2242 states have (on average 1.5138269402319358) internal successors, (3394), 2241 states have internal predecessors, (3394), 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:21,077 INFO L74 IsIncluded]: Start isIncluded. First operand 2242 states and 3394 transitions. Second operand has 2242 states, 2242 states have (on average 1.5138269402319358) internal successors, (3394), 2241 states have internal predecessors, (3394), 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:21,084 INFO L87 Difference]: Start difference. First operand 2242 states and 3394 transitions. Second operand has 2242 states, 2242 states have (on average 1.5138269402319358) internal successors, (3394), 2241 states have internal predecessors, (3394), 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:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:21,255 INFO L93 Difference]: Finished difference Result 2242 states and 3394 transitions. [2022-02-21 03:39:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 3394 transitions. [2022-02-21 03:39:21,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:21,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:21,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 2242 states, 2242 states have (on average 1.5138269402319358) internal successors, (3394), 2241 states have internal predecessors, (3394), 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 2242 states and 3394 transitions. [2022-02-21 03:39:21,270 INFO L87 Difference]: Start difference. First operand has 2242 states, 2242 states have (on average 1.5138269402319358) internal successors, (3394), 2241 states have internal predecessors, (3394), 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 2242 states and 3394 transitions. [2022-02-21 03:39:21,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:21,471 INFO L93 Difference]: Finished difference Result 2242 states and 3394 transitions. [2022-02-21 03:39:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 3394 transitions. [2022-02-21 03:39:21,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:21,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:21,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:21,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2242 states have (on average 1.5138269402319358) internal successors, (3394), 2241 states have internal predecessors, (3394), 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:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3394 transitions. [2022-02-21 03:39:21,638 INFO L704 BuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2022-02-21 03:39:21,638 INFO L587 BuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2022-02-21 03:39:21,638 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:39:21,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2242 states and 3394 transitions. [2022-02-21 03:39:21,653 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2022-02-21 03:39:21,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:21,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:21,655 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:21,655 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] [2022-02-21 03:39:21,655 INFO L791 eck$LassoCheckResult]: Stem: 11333#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 11300#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_~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_~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;havoc main_~cond~0#1; 11301#L183-1 [2022-02-21 03:39:21,655 INFO L793 eck$LassoCheckResult]: Loop: 11301#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 11520#L49 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; 11516#L78 assume !(0 != main_~p1~0#1); 11513#L78-2 assume !(0 != main_~p2~0#1); 11507#L82-1 assume !(0 != main_~p3~0#1); 11508#L86-1 assume !(0 != main_~p4~0#1); 11491#L90-1 assume !(0 != main_~p5~0#1); 11492#L94-1 assume !(0 != main_~p6~0#1); 11475#L98-1 assume !(0 != main_~p7~0#1); 11477#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 11463#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 11464#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 11451#L114-1 assume !(0 != main_~p11~0#1); 11452#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 11434#L122-1 assume !(0 != main_~p1~0#1); 11435#L128-1 assume !(0 != main_~p2~0#1); 11554#L133-1 assume !(0 != main_~p3~0#1); 11551#L138-1 assume !(0 != main_~p4~0#1); 11549#L143-1 assume !(0 != main_~p5~0#1); 11547#L148-1 assume !(0 != main_~p6~0#1); 11543#L153-1 assume !(0 != main_~p7~0#1); 11540#L158-1 assume !(0 != main_~p8~0#1); 11536#L163-1 assume !(0 != main_~p9~0#1); 11532#L168-1 assume !(0 != main_~p10~0#1); 11527#L173-1 assume !(0 != main_~p11~0#1); 11524#L178-1 assume !(0 != main_~p12~0#1); 11301#L183-1 [2022-02-21 03:39:21,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:21,656 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-02-21 03:39:21,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:21,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546234128] [2022-02-21 03:39:21,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:21,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:21,674 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:21,685 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:21,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:21,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1753248136, now seen corresponding path program 1 times [2022-02-21 03:39:21,686 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:21,686 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988770633] [2022-02-21 03:39:21,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:21,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:21,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {18025#true} assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {18025#true} is VALID [2022-02-21 03:39:21,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {18025#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; {18025#true} is VALID [2022-02-21 03:39:21,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {18025#true} assume !(0 != main_~p1~0#1); {18025#true} is VALID [2022-02-21 03:39:21,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {18025#true} assume !(0 != main_~p2~0#1); {18025#true} is VALID [2022-02-21 03:39:21,738 INFO L290 TraceCheckUtils]: 4: Hoare triple {18025#true} assume !(0 != main_~p3~0#1); {18025#true} is VALID [2022-02-21 03:39:21,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {18025#true} assume !(0 != main_~p4~0#1); {18025#true} is VALID [2022-02-21 03:39:21,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {18025#true} assume !(0 != main_~p5~0#1); {18025#true} is VALID [2022-02-21 03:39:21,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {18025#true} assume !(0 != main_~p6~0#1); {18025#true} is VALID [2022-02-21 03:39:21,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {18025#true} assume !(0 != main_~p7~0#1); {18025#true} is VALID [2022-02-21 03:39:21,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {18025#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:21,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:21,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:21,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p11~0#1); {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:21,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:21,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p1~0#1); {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:21,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p2~0#1); {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:21,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p3~0#1); {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:21,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p4~0#1); {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:21,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p5~0#1); {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:21,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p6~0#1); {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:21,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p7~0#1); {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:21,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {18027#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p8~0#1); {18026#false} is VALID [2022-02-21 03:39:21,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {18026#false} assume !(0 != main_~p9~0#1); {18026#false} is VALID [2022-02-21 03:39:21,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {18026#false} assume !(0 != main_~p10~0#1); {18026#false} is VALID [2022-02-21 03:39:21,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {18026#false} assume !(0 != main_~p11~0#1); {18026#false} is VALID [2022-02-21 03:39:21,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {18026#false} assume !(0 != main_~p12~0#1); {18026#false} is VALID [2022-02-21 03:39:21,753 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:21,753 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:21,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988770633] [2022-02-21 03:39:21,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988770633] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:21,754 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:21,754 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:21,754 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502515888] [2022-02-21 03:39:21,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:21,755 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:21,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:21,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:21,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:21,758 INFO L87 Difference]: Start difference. First operand 2242 states and 3394 transitions. cyclomatic complexity: 1216 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:39:22,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:22,372 INFO L93 Difference]: Finished difference Result 4418 states and 6594 transitions. [2022-02-21 03:39:22,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:22,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:39:22,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:22,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4418 states and 6594 transitions. [2022-02-21 03:39:22,944 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2022-02-21 03:39:23,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4418 states to 4418 states and 6594 transitions. [2022-02-21 03:39:23,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4418 [2022-02-21 03:39:23,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4418 [2022-02-21 03:39:23,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4418 states and 6594 transitions. [2022-02-21 03:39:23,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:23,413 INFO L681 BuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2022-02-21 03:39:23,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4418 states and 6594 transitions. [2022-02-21 03:39:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4418 to 4418. [2022-02-21 03:39:23,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:23,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4418 states and 6594 transitions. Second operand has 4418 states, 4418 states have (on average 1.4925305568130376) internal successors, (6594), 4417 states have internal predecessors, (6594), 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:23,499 INFO L74 IsIncluded]: Start isIncluded. First operand 4418 states and 6594 transitions. Second operand has 4418 states, 4418 states have (on average 1.4925305568130376) internal successors, (6594), 4417 states have internal predecessors, (6594), 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:23,506 INFO L87 Difference]: Start difference. First operand 4418 states and 6594 transitions. Second operand has 4418 states, 4418 states have (on average 1.4925305568130376) internal successors, (6594), 4417 states have internal predecessors, (6594), 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:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:23,951 INFO L93 Difference]: Finished difference Result 4418 states and 6594 transitions. [2022-02-21 03:39:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 4418 states and 6594 transitions. [2022-02-21 03:39:23,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:23,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:23,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 4418 states, 4418 states have (on average 1.4925305568130376) internal successors, (6594), 4417 states have internal predecessors, (6594), 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 4418 states and 6594 transitions. [2022-02-21 03:39:23,968 INFO L87 Difference]: Start difference. First operand has 4418 states, 4418 states have (on average 1.4925305568130376) internal successors, (6594), 4417 states have internal predecessors, (6594), 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 4418 states and 6594 transitions. [2022-02-21 03:39:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:24,383 INFO L93 Difference]: Finished difference Result 4418 states and 6594 transitions. [2022-02-21 03:39:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 4418 states and 6594 transitions. [2022-02-21 03:39:24,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:24,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:24,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:24,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:24,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4418 states, 4418 states have (on average 1.4925305568130376) internal successors, (6594), 4417 states have internal predecessors, (6594), 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:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 6594 transitions. [2022-02-21 03:39:24,858 INFO L704 BuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2022-02-21 03:39:24,858 INFO L587 BuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2022-02-21 03:39:24,858 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:39:24,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4418 states and 6594 transitions. [2022-02-21 03:39:24,881 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2022-02-21 03:39:24,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:24,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:24,882 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:24,882 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] [2022-02-21 03:39:24,882 INFO L791 eck$LassoCheckResult]: Stem: 22484#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 22452#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_~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_~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;havoc main_~cond~0#1; 22453#L183-1 [2022-02-21 03:39:24,882 INFO L793 eck$LassoCheckResult]: Loop: 22453#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 22841#L49 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; 22837#L78 assume !(0 != main_~p1~0#1); 22835#L78-2 assume !(0 != main_~p2~0#1); 22673#L82-1 assume !(0 != main_~p3~0#1); 22674#L86-1 assume !(0 != main_~p4~0#1); 22657#L90-1 assume !(0 != main_~p5~0#1); 22658#L94-1 assume !(0 != main_~p6~0#1); 22638#L98-1 assume !(0 != main_~p7~0#1); 22640#L102-1 assume !(0 != main_~p8~0#1); 22617#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 22618#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 22602#L114-1 assume !(0 != main_~p11~0#1); 22603#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 22587#L122-1 assume !(0 != main_~p1~0#1); 22588#L128-1 assume !(0 != main_~p2~0#1); 22826#L133-1 assume !(0 != main_~p3~0#1); 22814#L138-1 assume !(0 != main_~p4~0#1); 22815#L143-1 assume !(0 != main_~p5~0#1); 22786#L148-1 assume !(0 != main_~p6~0#1); 22788#L153-1 assume !(0 != main_~p7~0#1); 22860#L158-1 assume !(0 != main_~p8~0#1); 22857#L163-1 assume !(0 != main_~p9~0#1); 22853#L168-1 assume !(0 != main_~p10~0#1); 22848#L173-1 assume !(0 != main_~p11~0#1); 22845#L178-1 assume !(0 != main_~p12~0#1); 22453#L183-1 [2022-02-21 03:39:24,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:24,883 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-02-21 03:39:24,883 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:24,883 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730615886] [2022-02-21 03:39:24,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:24,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:24,888 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:24,892 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:24,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:24,892 INFO L85 PathProgramCache]: Analyzing trace with hash 164900234, now seen corresponding path program 1 times [2022-02-21 03:39:24,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:24,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282784089] [2022-02-21 03:39:24,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:24,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:24,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {35705#true} assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {35705#true} is VALID [2022-02-21 03:39:24,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {35705#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; {35705#true} is VALID [2022-02-21 03:39:24,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {35705#true} assume !(0 != main_~p1~0#1); {35705#true} is VALID [2022-02-21 03:39:24,911 INFO L290 TraceCheckUtils]: 3: Hoare triple {35705#true} assume !(0 != main_~p2~0#1); {35705#true} is VALID [2022-02-21 03:39:24,911 INFO L290 TraceCheckUtils]: 4: Hoare triple {35705#true} assume !(0 != main_~p3~0#1); {35705#true} is VALID [2022-02-21 03:39:24,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {35705#true} assume !(0 != main_~p4~0#1); {35705#true} is VALID [2022-02-21 03:39:24,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {35705#true} assume !(0 != main_~p5~0#1); {35705#true} is VALID [2022-02-21 03:39:24,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {35705#true} assume !(0 != main_~p6~0#1); {35705#true} is VALID [2022-02-21 03:39:24,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {35705#true} assume !(0 != main_~p7~0#1); {35705#true} is VALID [2022-02-21 03:39:24,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {35705#true} assume !(0 != main_~p8~0#1); {35705#true} is VALID [2022-02-21 03:39:24,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {35705#true} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:24,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:24,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p11~0#1); {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:24,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:24,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p1~0#1); {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:24,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p2~0#1); {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:24,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p3~0#1); {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:24,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p4~0#1); {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:24,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p5~0#1); {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:24,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p6~0#1); {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:24,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p7~0#1); {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:24,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p8~0#1); {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:24,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {35707#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p9~0#1); {35706#false} is VALID [2022-02-21 03:39:24,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {35706#false} assume !(0 != main_~p10~0#1); {35706#false} is VALID [2022-02-21 03:39:24,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {35706#false} assume !(0 != main_~p11~0#1); {35706#false} is VALID [2022-02-21 03:39:24,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {35706#false} assume !(0 != main_~p12~0#1); {35706#false} is VALID [2022-02-21 03:39:24,918 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:24,918 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:24,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282784089] [2022-02-21 03:39:24,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282784089] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:24,918 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:24,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:24,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255584715] [2022-02-21 03:39:24,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:24,919 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:24,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:24,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:24,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:24,920 INFO L87 Difference]: Start difference. First operand 4418 states and 6594 transitions. cyclomatic complexity: 2304 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:26,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:26,631 INFO L93 Difference]: Finished difference Result 8706 states and 12802 transitions. [2022-02-21 03:39:26,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:26,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:26,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:26,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8706 states and 12802 transitions. [2022-02-21 03:39:28,223 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2022-02-21 03:39:29,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8706 states to 8706 states and 12802 transitions. [2022-02-21 03:39:29,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8706 [2022-02-21 03:39:29,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8706 [2022-02-21 03:39:29,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8706 states and 12802 transitions. [2022-02-21 03:39:29,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:29,782 INFO L681 BuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2022-02-21 03:39:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8706 states and 12802 transitions. [2022-02-21 03:39:29,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8706 to 8706. [2022-02-21 03:39:29,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:29,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8706 states and 12802 transitions. Second operand has 8706 states, 8706 states have (on average 1.4704801286469102) internal successors, (12802), 8705 states have internal predecessors, (12802), 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:29,966 INFO L74 IsIncluded]: Start isIncluded. First operand 8706 states and 12802 transitions. Second operand has 8706 states, 8706 states have (on average 1.4704801286469102) internal successors, (12802), 8705 states have internal predecessors, (12802), 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:29,979 INFO L87 Difference]: Start difference. First operand 8706 states and 12802 transitions. Second operand has 8706 states, 8706 states have (on average 1.4704801286469102) internal successors, (12802), 8705 states have internal predecessors, (12802), 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:31,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:31,761 INFO L93 Difference]: Finished difference Result 8706 states and 12802 transitions. [2022-02-21 03:39:31,762 INFO L276 IsEmpty]: Start isEmpty. Operand 8706 states and 12802 transitions. [2022-02-21 03:39:31,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:31,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:31,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 8706 states, 8706 states have (on average 1.4704801286469102) internal successors, (12802), 8705 states have internal predecessors, (12802), 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 8706 states and 12802 transitions. [2022-02-21 03:39:31,794 INFO L87 Difference]: Start difference. First operand has 8706 states, 8706 states have (on average 1.4704801286469102) internal successors, (12802), 8705 states have internal predecessors, (12802), 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 8706 states and 12802 transitions. [2022-02-21 03:39:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:33,431 INFO L93 Difference]: Finished difference Result 8706 states and 12802 transitions. [2022-02-21 03:39:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 8706 states and 12802 transitions. [2022-02-21 03:39:33,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:33,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:33,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:33,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8706 states, 8706 states have (on average 1.4704801286469102) internal successors, (12802), 8705 states have internal predecessors, (12802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:39:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8706 states to 8706 states and 12802 transitions. [2022-02-21 03:39:35,101 INFO L704 BuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2022-02-21 03:39:35,101 INFO L587 BuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2022-02-21 03:39:35,101 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:39:35,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8706 states and 12802 transitions. [2022-02-21 03:39:35,124 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2022-02-21 03:39:35,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:35,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:35,125 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:35,125 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] [2022-02-21 03:39:35,125 INFO L791 eck$LassoCheckResult]: Stem: 44454#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 44420#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_~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_~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;havoc main_~cond~0#1; 44421#L183-1 [2022-02-21 03:39:35,125 INFO L793 eck$LassoCheckResult]: Loop: 44421#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 44833#L49 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; 44829#L78 assume !(0 != main_~p1~0#1); 44826#L78-2 assume !(0 != main_~p2~0#1); 44827#L82-1 assume !(0 != main_~p3~0#1); 44871#L86-1 assume !(0 != main_~p4~0#1); 44646#L90-1 assume !(0 != main_~p5~0#1); 44647#L94-1 assume !(0 != main_~p6~0#1); 44627#L98-1 assume !(0 != main_~p7~0#1); 44629#L102-1 assume !(0 != main_~p8~0#1); 44603#L106-1 assume !(0 != main_~p9~0#1); 44605#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 44586#L114-1 assume !(0 != main_~p11~0#1); 44587#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 44567#L122-1 assume !(0 != main_~p1~0#1); 44568#L128-1 assume !(0 != main_~p2~0#1); 44861#L133-1 assume !(0 != main_~p3~0#1); 44795#L138-1 assume !(0 != main_~p4~0#1); 44796#L143-1 assume !(0 != main_~p5~0#1); 44857#L148-1 assume !(0 != main_~p6~0#1); 44855#L153-1 assume !(0 != main_~p7~0#1); 44852#L158-1 assume !(0 != main_~p8~0#1); 44848#L163-1 assume !(0 != main_~p9~0#1); 44845#L168-1 assume !(0 != main_~p10~0#1); 44840#L173-1 assume !(0 != main_~p11~0#1); 44837#L178-1 assume !(0 != main_~p12~0#1); 44421#L183-1 [2022-02-21 03:39:35,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:35,126 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-02-21 03:39:35,126 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:35,126 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436177998] [2022-02-21 03:39:35,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:35,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:35,135 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:35,139 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:35,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:35,139 INFO L85 PathProgramCache]: Analyzing trace with hash -856168120, now seen corresponding path program 1 times [2022-02-21 03:39:35,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:35,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291600803] [2022-02-21 03:39:35,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:35,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:35,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {70537#true} assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {70537#true} is VALID [2022-02-21 03:39:35,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {70537#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; {70537#true} is VALID [2022-02-21 03:39:35,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {70537#true} assume !(0 != main_~p1~0#1); {70537#true} is VALID [2022-02-21 03:39:35,189 INFO L290 TraceCheckUtils]: 3: Hoare triple {70537#true} assume !(0 != main_~p2~0#1); {70537#true} is VALID [2022-02-21 03:39:35,190 INFO L290 TraceCheckUtils]: 4: Hoare triple {70537#true} assume !(0 != main_~p3~0#1); {70537#true} is VALID [2022-02-21 03:39:35,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {70537#true} assume !(0 != main_~p4~0#1); {70537#true} is VALID [2022-02-21 03:39:35,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {70537#true} assume !(0 != main_~p5~0#1); {70537#true} is VALID [2022-02-21 03:39:35,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {70537#true} assume !(0 != main_~p6~0#1); {70537#true} is VALID [2022-02-21 03:39:35,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {70537#true} assume !(0 != main_~p7~0#1); {70537#true} is VALID [2022-02-21 03:39:35,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {70537#true} assume !(0 != main_~p8~0#1); {70537#true} is VALID [2022-02-21 03:39:35,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {70537#true} assume !(0 != main_~p9~0#1); {70537#true} is VALID [2022-02-21 03:39:35,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {70537#true} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:35,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p11~0#1); {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:35,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:35,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p1~0#1); {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:35,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p2~0#1); {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:35,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p3~0#1); {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:35,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p4~0#1); {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:35,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p5~0#1); {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:35,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p6~0#1); {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:35,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p7~0#1); {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:35,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p8~0#1); {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:35,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p9~0#1); {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:35,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {70539#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p10~0#1); {70538#false} is VALID [2022-02-21 03:39:35,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {70538#false} assume !(0 != main_~p11~0#1); {70538#false} is VALID [2022-02-21 03:39:35,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {70538#false} assume !(0 != main_~p12~0#1); {70538#false} is VALID [2022-02-21 03:39:35,212 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:35,213 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:35,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291600803] [2022-02-21 03:39:35,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291600803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:35,213 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:35,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:35,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669882721] [2022-02-21 03:39:35,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:35,214 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:35,214 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:35,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:35,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:35,215 INFO L87 Difference]: Start difference. First operand 8706 states and 12802 transitions. cyclomatic complexity: 4352 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:41,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:41,154 INFO L93 Difference]: Finished difference Result 17154 states and 24834 transitions. [2022-02-21 03:39:41,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:41,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:41,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:41,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17154 states and 24834 transitions. [2022-02-21 03:39:46,974 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2022-02-21 03:39:52,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17154 states to 17154 states and 24834 transitions. [2022-02-21 03:39:52,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17154 [2022-02-21 03:39:52,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17154 [2022-02-21 03:39:52,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17154 states and 24834 transitions. [2022-02-21 03:39:52,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:52,790 INFO L681 BuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2022-02-21 03:39:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states and 24834 transitions. [2022-02-21 03:39:53,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2022-02-21 03:39:53,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:53,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17154 states and 24834 transitions. Second operand has 17154 states, 17154 states have (on average 1.4477089891570478) internal successors, (24834), 17153 states have internal predecessors, (24834), 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:53,078 INFO L74 IsIncluded]: Start isIncluded. First operand 17154 states and 24834 transitions. Second operand has 17154 states, 17154 states have (on average 1.4477089891570478) internal successors, (24834), 17153 states have internal predecessors, (24834), 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:53,098 INFO L87 Difference]: Start difference. First operand 17154 states and 24834 transitions. Second operand has 17154 states, 17154 states have (on average 1.4477089891570478) internal successors, (24834), 17153 states have internal predecessors, (24834), 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,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:59,236 INFO L93 Difference]: Finished difference Result 17154 states and 24834 transitions. [2022-02-21 03:39:59,236 INFO L276 IsEmpty]: Start isEmpty. Operand 17154 states and 24834 transitions. [2022-02-21 03:39:59,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:59,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:59,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 17154 states, 17154 states have (on average 1.4477089891570478) internal successors, (24834), 17153 states have internal predecessors, (24834), 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 17154 states and 24834 transitions. [2022-02-21 03:39:59,287 INFO L87 Difference]: Start difference. First operand has 17154 states, 17154 states have (on average 1.4477089891570478) internal successors, (24834), 17153 states have internal predecessors, (24834), 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 17154 states and 24834 transitions. [2022-02-21 03:40:05,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:05,741 INFO L93 Difference]: Finished difference Result 17154 states and 24834 transitions. [2022-02-21 03:40:05,741 INFO L276 IsEmpty]: Start isEmpty. Operand 17154 states and 24834 transitions. [2022-02-21 03:40:05,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:40:05,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:40:05,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:40:05,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:40:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17154 states, 17154 states have (on average 1.4477089891570478) internal successors, (24834), 17153 states have internal predecessors, (24834), 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,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 24834 transitions. [2022-02-21 03:40:11,677 INFO L704 BuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2022-02-21 03:40:11,677 INFO L587 BuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2022-02-21 03:40:11,677 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 03:40:11,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17154 states and 24834 transitions. [2022-02-21 03:40:11,733 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2022-02-21 03:40:11,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:40:11,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:40:11,734 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:40:11,734 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] [2022-02-21 03:40:11,734 INFO L791 eck$LassoCheckResult]: Stem: 87732#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 87700#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_~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_~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;havoc main_~cond~0#1; 87701#L183-1 [2022-02-21 03:40:11,735 INFO L793 eck$LassoCheckResult]: Loop: 87701#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 88266#L49 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; 88261#L78 assume !(0 != main_~p1~0#1); 88262#L78-2 assume !(0 != main_~p2~0#1); 88249#L82-1 assume !(0 != main_~p3~0#1); 88250#L86-1 assume !(0 != main_~p4~0#1); 88238#L90-1 assume !(0 != main_~p5~0#1); 88240#L94-1 assume !(0 != main_~p6~0#1); 88349#L98-1 assume !(0 != main_~p7~0#1); 88341#L102-1 assume !(0 != main_~p8~0#1); 88336#L106-1 assume !(0 != main_~p9~0#1); 88333#L110-1 assume !(0 != main_~p10~0#1); 88328#L114-1 assume !(0 != main_~p11~0#1); 88323#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 88318#L122-1 assume !(0 != main_~p1~0#1); 88312#L128-1 assume !(0 != main_~p2~0#1); 88311#L133-1 assume !(0 != main_~p3~0#1); 88307#L138-1 assume !(0 != main_~p4~0#1); 88304#L143-1 assume !(0 != main_~p5~0#1); 88300#L148-1 assume !(0 != main_~p6~0#1); 88296#L153-1 assume !(0 != main_~p7~0#1); 88292#L158-1 assume !(0 != main_~p8~0#1); 88288#L163-1 assume !(0 != main_~p9~0#1); 88280#L168-1 assume !(0 != main_~p10~0#1); 88278#L173-1 assume !(0 != main_~p11~0#1); 88277#L178-1 assume !(0 != main_~p12~0#1); 87701#L183-1 [2022-02-21 03:40:11,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:40:11,735 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-02-21 03:40:11,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:40:11,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106152283] [2022-02-21 03:40:11,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:40:11,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:40:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:40:11,743 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:40:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:40:11,747 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:40:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:40:11,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2136031798, now seen corresponding path program 1 times [2022-02-21 03:40:11,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:40:11,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844976157] [2022-02-21 03:40:11,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:40:11,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:40:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:40:11,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {139161#true} assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {139161#true} is VALID [2022-02-21 03:40:11,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {139161#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; {139161#true} is VALID [2022-02-21 03:40:11,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {139161#true} assume !(0 != main_~p1~0#1); {139161#true} is VALID [2022-02-21 03:40:11,764 INFO L290 TraceCheckUtils]: 3: Hoare triple {139161#true} assume !(0 != main_~p2~0#1); {139161#true} is VALID [2022-02-21 03:40:11,764 INFO L290 TraceCheckUtils]: 4: Hoare triple {139161#true} assume !(0 != main_~p3~0#1); {139161#true} is VALID [2022-02-21 03:40:11,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {139161#true} assume !(0 != main_~p4~0#1); {139161#true} is VALID [2022-02-21 03:40:11,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {139161#true} assume !(0 != main_~p5~0#1); {139161#true} is VALID [2022-02-21 03:40:11,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {139161#true} assume !(0 != main_~p6~0#1); {139161#true} is VALID [2022-02-21 03:40:11,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {139161#true} assume !(0 != main_~p7~0#1); {139161#true} is VALID [2022-02-21 03:40:11,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {139161#true} assume !(0 != main_~p8~0#1); {139161#true} is VALID [2022-02-21 03:40:11,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {139161#true} assume !(0 != main_~p9~0#1); {139161#true} is VALID [2022-02-21 03:40:11,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {139161#true} assume !(0 != main_~p10~0#1); {139161#true} is VALID [2022-02-21 03:40:11,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {139161#true} assume !(0 != main_~p11~0#1); {139161#true} is VALID [2022-02-21 03:40:11,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {139161#true} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:11,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p1~0#1); {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:11,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p2~0#1); {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:11,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p3~0#1); {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:11,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p4~0#1); {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:11,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p5~0#1); {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:11,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p6~0#1); {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:11,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p7~0#1); {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:11,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p8~0#1); {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:11,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p9~0#1); {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:11,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p10~0#1); {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:11,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p11~0#1); {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:11,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {139163#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p12~0#1); {139162#false} is VALID [2022-02-21 03:40:11,771 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:11,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:40:11,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844976157] [2022-02-21 03:40:11,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844976157] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:40:11,772 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:40:11,772 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:40:11,772 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511205662] [2022-02-21 03:40:11,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:40:11,773 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:40:11,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:40:11,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:40:11,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:40:11,774 INFO L87 Difference]: Start difference. First operand 17154 states and 24834 transitions. cyclomatic complexity: 8192 Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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)