./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_13.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_13.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 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:39:19,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:39:19,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:39:19,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:39:19,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:39:19,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:39:19,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:39:19,225 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:39:19,227 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:39:19,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:39:19,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:39:19,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:39:19,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:39:19,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:39:19,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:39:19,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:39:19,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:39:19,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:39:19,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:39:19,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:39:19,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:39:19,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:39:19,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:39:19,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:39:19,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:39:19,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:39:19,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:39:19,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:39:19,258 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:39:19,259 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:39:19,259 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:39:19,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:39:19,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:39:19,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:39:19,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:39:19,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:39:19,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:39:19,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:39:19,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:39:19,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:39:19,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:39:19,265 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:19,293 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:39:19,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:39:19,294 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:39:19,294 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:39:19,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:39:19,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:39:19,296 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:39:19,296 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:39:19,296 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:39:19,296 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:39:19,297 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:39:19,297 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:39:19,297 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:39:19,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:39:19,297 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:39:19,298 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:39:19,298 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:39:19,298 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:39:19,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:39:19,298 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:39:19,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:39:19,298 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:39:19,299 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:39:19,299 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:39:19,299 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:39:19,299 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:39:19,299 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:39:19,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:39:19,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:39:19,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:39:19,300 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:39:19,300 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:39:19,301 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 -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2022-02-21 03:39:19,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:39:19,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:39:19,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:39:19,522 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:39:19,523 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:39:19,524 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_13.c [2022-02-21 03:39:19,597 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388a1f3bb/ee492d00d6fc4a089f1f03c40ad72881/FLAGf5f12a80c [2022-02-21 03:39:19,900 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:39:19,900 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2022-02-21 03:39:19,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388a1f3bb/ee492d00d6fc4a089f1f03c40ad72881/FLAGf5f12a80c [2022-02-21 03:39:20,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388a1f3bb/ee492d00d6fc4a089f1f03c40ad72881 [2022-02-21 03:39:20,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:39:20,330 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:39:20,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:39:20,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:39:20,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:39:20,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:39:20" (1/1) ... [2022-02-21 03:39:20,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223b257e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:20, skipping insertion in model container [2022-02-21 03:39:20,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:39:20" (1/1) ... [2022-02-21 03:39:20,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:39:20,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:39:20,481 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_13.c[4936,4949] [2022-02-21 03:39:20,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:39:20,488 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:39:20,505 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_13.c[4936,4949] [2022-02-21 03:39:20,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:39:20,514 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:39:20,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:20 WrapperNode [2022-02-21 03:39:20,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:39:20,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:39:20,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:39:20,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:39:20,520 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:20" (1/1) ... [2022-02-21 03:39:20,525 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:20" (1/1) ... [2022-02-21 03:39:20,542 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 157 [2022-02-21 03:39:20,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:39:20,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:39:20,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:39:20,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:39:20,548 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:20" (1/1) ... [2022-02-21 03:39:20,548 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:20" (1/1) ... [2022-02-21 03:39:20,550 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:20" (1/1) ... [2022-02-21 03:39:20,550 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:20" (1/1) ... [2022-02-21 03:39:20,553 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:20" (1/1) ... [2022-02-21 03:39:20,557 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:20" (1/1) ... [2022-02-21 03:39:20,558 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:20" (1/1) ... [2022-02-21 03:39:20,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:39:20,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:39:20,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:39:20,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:39:20,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:20" (1/1) ... [2022-02-21 03:39:20,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:39:20,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:39:20,622 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:20,642 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:20,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:39:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:39:20,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:39:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:39:20,715 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:39:20,717 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:39:20,840 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:39:20,844 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:39:20,845 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:39:20,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:39:20 BoogieIcfgContainer [2022-02-21 03:39:20,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:39:20,847 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:39:20,847 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:39:20,849 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:39:20,850 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:20,850 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:39:20" (1/3) ... [2022-02-21 03:39:20,851 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b1d6923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:39:20, skipping insertion in model container [2022-02-21 03:39:20,851 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:20,851 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:20" (2/3) ... [2022-02-21 03:39:20,852 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b1d6923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:39:20, skipping insertion in model container [2022-02-21 03:39:20,852 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:20,852 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:39:20" (3/3) ... [2022-02-21 03:39:20,853 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_13.c [2022-02-21 03:39:20,884 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:39:20,884 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:39:20,884 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:39:20,884 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:39:20,884 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:39:20,890 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:39:20,890 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:39:20,890 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:39:20,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 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,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2022-02-21 03:39:20,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:20,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:20,961 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:20,961 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:39:20,962 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:39:20,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 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,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2022-02-21 03:39:20,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:20,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:20,976 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:20,977 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:39:20,982 INFO L791 eck$LassoCheckResult]: Stem: 23#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_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 14#L197-1true [2022-02-21 03:39:20,983 INFO L793 eck$LassoCheckResult]: Loop: 14#L197-1true assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 44#L52true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 29#L83true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 16#L83-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 10#L87-1true assume !(0 != main_~p3~0#1); 4#L91-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 46#L95-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 17#L99-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 11#L103-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 26#L107-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 15#L111-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 33#L115-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 35#L119-1true assume !(0 != main_~p11~0#1); 47#L123-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 27#L127-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 36#L131-1true assume !(0 != main_~p1~0#1); 13#L137-1true assume !(0 != main_~p2~0#1); 8#L142-1true assume !(0 != main_~p3~0#1); 37#L147-1true assume !(0 != main_~p4~0#1); 12#L152-1true assume !(0 != main_~p5~0#1); 21#L157-1true assume !(0 != main_~p6~0#1); 18#L162-1true assume !(0 != main_~p7~0#1); 19#L167-1true assume !(0 != main_~p8~0#1); 24#L172-1true assume !(0 != main_~p9~0#1); 32#L177-1true assume !(0 != main_~p10~0#1); 48#L182-1true assume !(0 != main_~p11~0#1); 45#L187-1true assume !(0 != main_~p12~0#1); 39#L192-1true assume !(0 != main_~p13~0#1); 14#L197-1true [2022-02-21 03:39:20,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:20,993 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:39:20,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:21,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143841071] [2022-02-21 03:39:21,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:21,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:21,074 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:21,107 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:21,110 INFO L85 PathProgramCache]: Analyzing trace with hash 203947253, now seen corresponding path program 1 times [2022-02-21 03:39:21,110 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:21,111 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397709504] [2022-02-21 03:39:21,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:21,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:21,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#true} assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {54#true} is VALID [2022-02-21 03:39:21,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {54#true} is VALID [2022-02-21 03:39:21,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:21,205 INFO L290 TraceCheckUtils]: 3: Hoare triple {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:21,205 INFO L290 TraceCheckUtils]: 4: Hoare triple {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:21,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:21,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:21,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:21,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:21,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:21,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:21,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:21,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p11~0#1); {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:21,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:21,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:21,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {56#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {55#false} is VALID [2022-02-21 03:39:21,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {55#false} assume !(0 != main_~p2~0#1); {55#false} is VALID [2022-02-21 03:39:21,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {55#false} assume !(0 != main_~p3~0#1); {55#false} is VALID [2022-02-21 03:39:21,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {55#false} assume !(0 != main_~p4~0#1); {55#false} is VALID [2022-02-21 03:39:21,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {55#false} assume !(0 != main_~p5~0#1); {55#false} is VALID [2022-02-21 03:39:21,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {55#false} assume !(0 != main_~p6~0#1); {55#false} is VALID [2022-02-21 03:39:21,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {55#false} assume !(0 != main_~p7~0#1); {55#false} is VALID [2022-02-21 03:39:21,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {55#false} assume !(0 != main_~p8~0#1); {55#false} is VALID [2022-02-21 03:39:21,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {55#false} assume !(0 != main_~p9~0#1); {55#false} is VALID [2022-02-21 03:39:21,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {55#false} assume !(0 != main_~p10~0#1); {55#false} is VALID [2022-02-21 03:39:21,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {55#false} assume !(0 != main_~p11~0#1); {55#false} is VALID [2022-02-21 03:39:21,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {55#false} assume !(0 != main_~p12~0#1); {55#false} is VALID [2022-02-21 03:39:21,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {55#false} assume !(0 != main_~p13~0#1); {55#false} is VALID [2022-02-21 03:39:21,214 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,214 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:21,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397709504] [2022-02-21 03:39:21,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397709504] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:21,215 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:21,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:21,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588414633] [2022-02-21 03:39:21,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:21,219 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:21,219 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:21,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:21,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:21,238 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 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 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:21,353 INFO L93 Difference]: Finished difference Result 93 states and 166 transitions. [2022-02-21 03:39:21,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:21,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:21,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 166 transitions. [2022-02-21 03:39:21,386 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2022-02-21 03:39:21,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 83 states and 133 transitions. [2022-02-21 03:39:21,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2022-02-21 03:39:21,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2022-02-21 03:39:21,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 133 transitions. [2022-02-21 03:39:21,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:21,392 INFO L681 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2022-02-21 03:39:21,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 133 transitions. [2022-02-21 03:39:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-02-21 03:39:21,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:21,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states and 133 transitions. Second operand has 83 states, 83 states have (on average 1.6024096385542168) internal successors, (133), 82 states have internal predecessors, (133), 0 states have call successors, (0), 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,411 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states and 133 transitions. Second operand has 83 states, 83 states have (on average 1.6024096385542168) internal successors, (133), 82 states have internal predecessors, (133), 0 states have call successors, (0), 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,413 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. Second operand has 83 states, 83 states have (on average 1.6024096385542168) internal successors, (133), 82 states have internal predecessors, (133), 0 states have call successors, (0), 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,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:21,416 INFO L93 Difference]: Finished difference Result 83 states and 133 transitions. [2022-02-21 03:39:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 133 transitions. [2022-02-21 03:39:21,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:21,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:21,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 83 states have (on average 1.6024096385542168) internal successors, (133), 82 states have internal predecessors, (133), 0 states have call successors, (0), 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 83 states and 133 transitions. [2022-02-21 03:39:21,418 INFO L87 Difference]: Start difference. First operand has 83 states, 83 states have (on average 1.6024096385542168) internal successors, (133), 82 states have internal predecessors, (133), 0 states have call successors, (0), 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 83 states and 133 transitions. [2022-02-21 03:39:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:21,421 INFO L93 Difference]: Finished difference Result 83 states and 133 transitions. [2022-02-21 03:39:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 133 transitions. [2022-02-21 03:39:21,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:21,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:21,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:21,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.6024096385542168) internal successors, (133), 82 states have internal predecessors, (133), 0 states have call successors, (0), 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,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2022-02-21 03:39:21,426 INFO L704 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2022-02-21 03:39:21,426 INFO L587 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2022-02-21 03:39:21,426 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:39:21,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 133 transitions. [2022-02-21 03:39:21,427 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2022-02-21 03:39:21,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:21,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:21,428 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:21,428 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:39:21,428 INFO L791 eck$LassoCheckResult]: Stem: 181#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); 156#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 157#L197-1 [2022-02-21 03:39:21,429 INFO L793 eck$LassoCheckResult]: Loop: 157#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 209#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 208#L83 assume !(0 != main_~p1~0#1); 207#L83-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 206#L87-1 assume !(0 != main_~p3~0#1); 205#L91-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 198#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 174#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 164#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 165#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 202#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 192#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 193#L119-1 assume !(0 != main_~p11~0#1); 201#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 185#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 186#L131-1 assume !(0 != main_~p1~0#1); 200#L137-1 assume !(0 != main_~p2~0#1); 231#L142-1 assume !(0 != main_~p3~0#1); 229#L147-1 assume !(0 != main_~p4~0#1); 227#L152-1 assume !(0 != main_~p5~0#1); 225#L157-1 assume !(0 != main_~p6~0#1); 223#L162-1 assume !(0 != main_~p7~0#1); 221#L167-1 assume !(0 != main_~p8~0#1); 218#L172-1 assume !(0 != main_~p9~0#1); 217#L177-1 assume !(0 != main_~p10~0#1); 215#L182-1 assume !(0 != main_~p11~0#1); 212#L187-1 assume !(0 != main_~p12~0#1); 211#L192-1 assume !(0 != main_~p13~0#1); 157#L197-1 [2022-02-21 03:39:21,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:21,429 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:39:21,429 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:21,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494991201] [2022-02-21 03:39:21,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:21,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:21,435 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:21,440 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:21,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:21,441 INFO L85 PathProgramCache]: Analyzing trace with hash 265986867, now seen corresponding path program 1 times [2022-02-21 03:39:21,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:21,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386027914] [2022-02-21 03:39:21,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:21,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:21,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {404#true} assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {404#true} is VALID [2022-02-21 03:39:21,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {404#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {404#true} is VALID [2022-02-21 03:39:21,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {404#true} assume !(0 != main_~p1~0#1); {404#true} is VALID [2022-02-21 03:39:21,468 INFO L290 TraceCheckUtils]: 3: Hoare triple {404#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:21,469 INFO L290 TraceCheckUtils]: 4: Hoare triple {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:21,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:21,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:21,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:21,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:21,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:21,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:21,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:21,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p11~0#1); {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:21,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:21,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:21,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:21,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {406#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {405#false} is VALID [2022-02-21 03:39:21,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {405#false} assume !(0 != main_~p3~0#1); {405#false} is VALID [2022-02-21 03:39:21,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {405#false} assume !(0 != main_~p4~0#1); {405#false} is VALID [2022-02-21 03:39:21,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {405#false} assume !(0 != main_~p5~0#1); {405#false} is VALID [2022-02-21 03:39:21,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {405#false} assume !(0 != main_~p6~0#1); {405#false} is VALID [2022-02-21 03:39:21,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {405#false} assume !(0 != main_~p7~0#1); {405#false} is VALID [2022-02-21 03:39:21,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {405#false} assume !(0 != main_~p8~0#1); {405#false} is VALID [2022-02-21 03:39:21,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {405#false} assume !(0 != main_~p9~0#1); {405#false} is VALID [2022-02-21 03:39:21,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {405#false} assume !(0 != main_~p10~0#1); {405#false} is VALID [2022-02-21 03:39:21,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {405#false} assume !(0 != main_~p11~0#1); {405#false} is VALID [2022-02-21 03:39:21,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {405#false} assume !(0 != main_~p12~0#1); {405#false} is VALID [2022-02-21 03:39:21,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {405#false} assume !(0 != main_~p13~0#1); {405#false} is VALID [2022-02-21 03:39:21,476 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,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:21,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386027914] [2022-02-21 03:39:21,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386027914] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:21,476 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:21,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:21,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196929959] [2022-02-21 03:39:21,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:21,477 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:21,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:21,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:21,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:21,478 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:21,574 INFO L93 Difference]: Finished difference Result 162 states and 258 transitions. [2022-02-21 03:39:21,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:21,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:21,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 258 transitions. [2022-02-21 03:39:21,616 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2022-02-21 03:39:21,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 258 transitions. [2022-02-21 03:39:21,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2022-02-21 03:39:21,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2022-02-21 03:39:21,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 258 transitions. [2022-02-21 03:39:21,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:21,633 INFO L681 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2022-02-21 03:39:21,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 258 transitions. [2022-02-21 03:39:21,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-02-21 03:39:21,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:21,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states and 258 transitions. Second operand has 162 states, 162 states have (on average 1.5925925925925926) internal successors, (258), 161 states have internal predecessors, (258), 0 states have call successors, (0), 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,643 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states and 258 transitions. Second operand has 162 states, 162 states have (on average 1.5925925925925926) internal successors, (258), 161 states have internal predecessors, (258), 0 states have call successors, (0), 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,643 INFO L87 Difference]: Start difference. First operand 162 states and 258 transitions. Second operand has 162 states, 162 states have (on average 1.5925925925925926) internal successors, (258), 161 states have internal predecessors, (258), 0 states have call successors, (0), 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,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:21,649 INFO L93 Difference]: Finished difference Result 162 states and 258 transitions. [2022-02-21 03:39:21,649 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 258 transitions. [2022-02-21 03:39:21,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:21,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:21,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 162 states have (on average 1.5925925925925926) internal successors, (258), 161 states have internal predecessors, (258), 0 states have call successors, (0), 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 162 states and 258 transitions. [2022-02-21 03:39:21,656 INFO L87 Difference]: Start difference. First operand has 162 states, 162 states have (on average 1.5925925925925926) internal successors, (258), 161 states have internal predecessors, (258), 0 states have call successors, (0), 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 162 states and 258 transitions. [2022-02-21 03:39:21,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:21,660 INFO L93 Difference]: Finished difference Result 162 states and 258 transitions. [2022-02-21 03:39:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 258 transitions. [2022-02-21 03:39:21,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:21,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:21,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:21,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 162 states have (on average 1.5925925925925926) internal successors, (258), 161 states have internal predecessors, (258), 0 states have call successors, (0), 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,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 258 transitions. [2022-02-21 03:39:21,665 INFO L704 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2022-02-21 03:39:21,665 INFO L587 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2022-02-21 03:39:21,665 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:39:21,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 258 transitions. [2022-02-21 03:39:21,666 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2022-02-21 03:39:21,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:21,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:21,667 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:21,667 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:39:21,667 INFO L791 eck$LassoCheckResult]: Stem: 602#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); 575#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 574#L197-1 [2022-02-21 03:39:21,667 INFO L793 eck$LassoCheckResult]: Loop: 574#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 589#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 658#L83 assume !(0 != main_~p1~0#1); 659#L83-2 assume !(0 != main_~p2~0#1); 702#L87-1 assume !(0 != main_~p3~0#1); 700#L91-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 698#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 696#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 695#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 694#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 693#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 692#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 691#L119-1 assume !(0 != main_~p11~0#1); 690#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 689#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 687#L131-1 assume !(0 != main_~p1~0#1); 688#L137-1 assume !(0 != main_~p2~0#1); 576#L142-1 assume !(0 != main_~p3~0#1); 578#L147-1 assume !(0 != main_~p4~0#1); 584#L152-1 assume !(0 != main_~p5~0#1); 585#L157-1 assume !(0 != main_~p6~0#1); 596#L162-1 assume !(0 != main_~p7~0#1); 572#L167-1 assume !(0 != main_~p8~0#1); 594#L172-1 assume !(0 != main_~p9~0#1); 600#L177-1 assume !(0 != main_~p10~0#1); 611#L182-1 assume !(0 != main_~p11~0#1); 599#L187-1 assume !(0 != main_~p12~0#1); 607#L192-1 assume !(0 != main_~p13~0#1); 574#L197-1 [2022-02-21 03:39:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-02-21 03:39:21,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:21,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899670454] [2022-02-21 03:39:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:21,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:21,674 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,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:21,678 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:21,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:21,679 INFO L85 PathProgramCache]: Analyzing trace with hash 406535477, now seen corresponding path program 1 times [2022-02-21 03:39:21,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:21,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488485178] [2022-02-21 03:39:21,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:21,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:21,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {1060#true} assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {1060#true} is VALID [2022-02-21 03:39:21,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {1060#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {1060#true} is VALID [2022-02-21 03:39:21,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {1060#true} assume !(0 != main_~p1~0#1); {1060#true} is VALID [2022-02-21 03:39:21,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {1060#true} assume !(0 != main_~p2~0#1); {1060#true} is VALID [2022-02-21 03:39:21,720 INFO L290 TraceCheckUtils]: 4: Hoare triple {1060#true} assume !(0 != main_~p3~0#1); {1060#true} is VALID [2022-02-21 03:39:21,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {1060#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:21,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:21,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:21,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:21,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:21,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:21,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:21,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p11~0#1); {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:21,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:21,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:21,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:21,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:21,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:21,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {1062#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {1061#false} is VALID [2022-02-21 03:39:21,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {1061#false} assume !(0 != main_~p5~0#1); {1061#false} is VALID [2022-02-21 03:39:21,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {1061#false} assume !(0 != main_~p6~0#1); {1061#false} is VALID [2022-02-21 03:39:21,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {1061#false} assume !(0 != main_~p7~0#1); {1061#false} is VALID [2022-02-21 03:39:21,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {1061#false} assume !(0 != main_~p8~0#1); {1061#false} is VALID [2022-02-21 03:39:21,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {1061#false} assume !(0 != main_~p9~0#1); {1061#false} is VALID [2022-02-21 03:39:21,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {1061#false} assume !(0 != main_~p10~0#1); {1061#false} is VALID [2022-02-21 03:39:21,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {1061#false} assume !(0 != main_~p11~0#1); {1061#false} is VALID [2022-02-21 03:39:21,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {1061#false} assume !(0 != main_~p12~0#1); {1061#false} is VALID [2022-02-21 03:39:21,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {1061#false} assume !(0 != main_~p13~0#1); {1061#false} is VALID [2022-02-21 03:39:21,732 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,732 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:21,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488485178] [2022-02-21 03:39:21,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488485178] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:21,732 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:21,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:21,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969171937] [2022-02-21 03:39:21,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:21,734 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:21,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:21,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:21,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:21,735 INFO L87 Difference]: Start difference. First operand 162 states and 258 transitions. cyclomatic complexity: 100 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:21,826 INFO L93 Difference]: Finished difference Result 318 states and 502 transitions. [2022-02-21 03:39:21,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:21,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:21,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 502 transitions. [2022-02-21 03:39:21,859 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2022-02-21 03:39:21,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 318 states and 502 transitions. [2022-02-21 03:39:21,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 318 [2022-02-21 03:39:21,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2022-02-21 03:39:21,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 502 transitions. [2022-02-21 03:39:21,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:21,870 INFO L681 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2022-02-21 03:39:21,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 502 transitions. [2022-02-21 03:39:21,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2022-02-21 03:39:21,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:21,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 318 states and 502 transitions. Second operand has 318 states, 318 states have (on average 1.578616352201258) internal successors, (502), 317 states have internal predecessors, (502), 0 states have call successors, (0), 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,898 INFO L74 IsIncluded]: Start isIncluded. First operand 318 states and 502 transitions. Second operand has 318 states, 318 states have (on average 1.578616352201258) internal successors, (502), 317 states have internal predecessors, (502), 0 states have call successors, (0), 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,898 INFO L87 Difference]: Start difference. First operand 318 states and 502 transitions. Second operand has 318 states, 318 states have (on average 1.578616352201258) internal successors, (502), 317 states have internal predecessors, (502), 0 states have call successors, (0), 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,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:21,909 INFO L93 Difference]: Finished difference Result 318 states and 502 transitions. [2022-02-21 03:39:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 502 transitions. [2022-02-21 03:39:21,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:21,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:21,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 318 states, 318 states have (on average 1.578616352201258) internal successors, (502), 317 states have internal predecessors, (502), 0 states have call successors, (0), 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 318 states and 502 transitions. [2022-02-21 03:39:21,918 INFO L87 Difference]: Start difference. First operand has 318 states, 318 states have (on average 1.578616352201258) internal successors, (502), 317 states have internal predecessors, (502), 0 states have call successors, (0), 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 318 states and 502 transitions. [2022-02-21 03:39:21,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:21,928 INFO L93 Difference]: Finished difference Result 318 states and 502 transitions. [2022-02-21 03:39:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 502 transitions. [2022-02-21 03:39:21,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:21,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:21,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:21,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 318 states have (on average 1.578616352201258) internal successors, (502), 317 states have internal predecessors, (502), 0 states have call successors, (0), 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,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 502 transitions. [2022-02-21 03:39:21,937 INFO L704 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2022-02-21 03:39:21,937 INFO L587 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2022-02-21 03:39:21,937 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:39:21,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 502 transitions. [2022-02-21 03:39:21,939 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2022-02-21 03:39:21,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:21,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:21,940 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:21,940 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:39:21,940 INFO L791 eck$LassoCheckResult]: Stem: 1414#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); 1387#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 1388#L197-1 [2022-02-21 03:39:21,940 INFO L793 eck$LassoCheckResult]: Loop: 1388#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 1527#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 1525#L83 assume !(0 != main_~p1~0#1); 1523#L83-2 assume !(0 != main_~p2~0#1); 1524#L87-1 assume !(0 != main_~p3~0#1); 1595#L91-1 assume !(0 != main_~p4~0#1); 1594#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1591#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1588#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1585#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1582#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1580#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1577#L119-1 assume !(0 != main_~p11~0#1); 1575#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1571#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1567#L131-1 assume !(0 != main_~p1~0#1); 1562#L137-1 assume !(0 != main_~p2~0#1); 1515#L142-1 assume !(0 != main_~p3~0#1); 1514#L147-1 assume !(0 != main_~p4~0#1); 1554#L152-1 assume !(0 != main_~p5~0#1); 1550#L157-1 assume !(0 != main_~p6~0#1); 1546#L162-1 assume !(0 != main_~p7~0#1); 1542#L167-1 assume !(0 != main_~p8~0#1); 1538#L172-1 assume !(0 != main_~p9~0#1); 1536#L177-1 assume !(0 != main_~p10~0#1); 1533#L182-1 assume !(0 != main_~p11~0#1); 1530#L187-1 assume !(0 != main_~p12~0#1); 1529#L192-1 assume !(0 != main_~p13~0#1); 1388#L197-1 [2022-02-21 03:39:21,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:21,943 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-02-21 03:39:21,943 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:21,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257754690] [2022-02-21 03:39:21,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:21,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:21,953 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:21,962 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:21,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1398902857, now seen corresponding path program 1 times [2022-02-21 03:39:21,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:21,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937453885] [2022-02-21 03:39:21,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:21,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:21,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {2340#true} assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {2340#true} is VALID [2022-02-21 03:39:21,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {2340#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {2340#true} is VALID [2022-02-21 03:39:21,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {2340#true} assume !(0 != main_~p1~0#1); {2340#true} is VALID [2022-02-21 03:39:21,989 INFO L290 TraceCheckUtils]: 3: Hoare triple {2340#true} assume !(0 != main_~p2~0#1); {2340#true} is VALID [2022-02-21 03:39:21,990 INFO L290 TraceCheckUtils]: 4: Hoare triple {2340#true} assume !(0 != main_~p3~0#1); {2340#true} is VALID [2022-02-21 03:39:21,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {2340#true} assume !(0 != main_~p4~0#1); {2340#true} is VALID [2022-02-21 03:39:21,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {2340#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:21,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:21,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:21,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:21,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:21,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:21,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p11~0#1); {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:21,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:21,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:21,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:21,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:21,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:21,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:21,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {2342#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {2341#false} is VALID [2022-02-21 03:39:21,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {2341#false} assume !(0 != main_~p6~0#1); {2341#false} is VALID [2022-02-21 03:39:21,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {2341#false} assume !(0 != main_~p7~0#1); {2341#false} is VALID [2022-02-21 03:39:21,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {2341#false} assume !(0 != main_~p8~0#1); {2341#false} is VALID [2022-02-21 03:39:21,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {2341#false} assume !(0 != main_~p9~0#1); {2341#false} is VALID [2022-02-21 03:39:21,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {2341#false} assume !(0 != main_~p10~0#1); {2341#false} is VALID [2022-02-21 03:39:21,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {2341#false} assume !(0 != main_~p11~0#1); {2341#false} is VALID [2022-02-21 03:39:21,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {2341#false} assume !(0 != main_~p12~0#1); {2341#false} is VALID [2022-02-21 03:39:21,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {2341#false} assume !(0 != main_~p13~0#1); {2341#false} is VALID [2022-02-21 03:39:21,996 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,996 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:21,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937453885] [2022-02-21 03:39:21,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937453885] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:21,997 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:21,997 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:21,997 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883313915] [2022-02-21 03:39:21,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:21,997 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:21,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:21,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:21,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:21,998 INFO L87 Difference]: Start difference. First operand 318 states and 502 transitions. cyclomatic complexity: 192 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:22,090 INFO L93 Difference]: Finished difference Result 626 states and 978 transitions. [2022-02-21 03:39:22,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:22,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:22,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 626 states and 978 transitions. [2022-02-21 03:39:22,122 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2022-02-21 03:39:22,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 626 states to 626 states and 978 transitions. [2022-02-21 03:39:22,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2022-02-21 03:39:22,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2022-02-21 03:39:22,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 626 states and 978 transitions. [2022-02-21 03:39:22,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:22,136 INFO L681 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2022-02-21 03:39:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states and 978 transitions. [2022-02-21 03:39:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2022-02-21 03:39:22,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:22,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 626 states and 978 transitions. Second operand has 626 states, 626 states have (on average 1.5623003194888179) internal successors, (978), 625 states have internal predecessors, (978), 0 states have call successors, (0), 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,166 INFO L74 IsIncluded]: Start isIncluded. First operand 626 states and 978 transitions. Second operand has 626 states, 626 states have (on average 1.5623003194888179) internal successors, (978), 625 states have internal predecessors, (978), 0 states have call successors, (0), 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,167 INFO L87 Difference]: Start difference. First operand 626 states and 978 transitions. Second operand has 626 states, 626 states have (on average 1.5623003194888179) internal successors, (978), 625 states have internal predecessors, (978), 0 states have call successors, (0), 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,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:22,178 INFO L93 Difference]: Finished difference Result 626 states and 978 transitions. [2022-02-21 03:39:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 978 transitions. [2022-02-21 03:39:22,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:22,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:22,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 626 states, 626 states have (on average 1.5623003194888179) internal successors, (978), 625 states have internal predecessors, (978), 0 states have call successors, (0), 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 626 states and 978 transitions. [2022-02-21 03:39:22,181 INFO L87 Difference]: Start difference. First operand has 626 states, 626 states have (on average 1.5623003194888179) internal successors, (978), 625 states have internal predecessors, (978), 0 states have call successors, (0), 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 626 states and 978 transitions. [2022-02-21 03:39:22,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:22,193 INFO L93 Difference]: Finished difference Result 626 states and 978 transitions. [2022-02-21 03:39:22,193 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 978 transitions. [2022-02-21 03:39:22,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:22,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:22,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:22,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:22,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 626 states have (on average 1.5623003194888179) internal successors, (978), 625 states have internal predecessors, (978), 0 states have call successors, (0), 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,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 978 transitions. [2022-02-21 03:39:22,206 INFO L704 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2022-02-21 03:39:22,206 INFO L587 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2022-02-21 03:39:22,206 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:39:22,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 626 states and 978 transitions. [2022-02-21 03:39:22,208 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2022-02-21 03:39:22,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:22,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:22,210 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:22,210 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:39:22,210 INFO L791 eck$LassoCheckResult]: Stem: 3005#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); 2975#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 2976#L197-1 [2022-02-21 03:39:22,210 INFO L793 eck$LassoCheckResult]: Loop: 2976#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 3081#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 3079#L83 assume !(0 != main_~p1~0#1); 3075#L83-2 assume !(0 != main_~p2~0#1); 3073#L87-1 assume !(0 != main_~p3~0#1); 3069#L91-1 assume !(0 != main_~p4~0#1); 3065#L95-1 assume !(0 != main_~p5~0#1); 3063#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 3061#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3059#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3057#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3055#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3053#L119-1 assume !(0 != main_~p11~0#1); 3051#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 3049#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 3046#L131-1 assume !(0 != main_~p1~0#1); 3047#L137-1 assume !(0 != main_~p2~0#1); 3125#L142-1 assume !(0 != main_~p3~0#1); 3120#L147-1 assume !(0 != main_~p4~0#1); 3116#L152-1 assume !(0 != main_~p5~0#1); 3113#L157-1 assume !(0 != main_~p6~0#1); 3109#L162-1 assume !(0 != main_~p7~0#1); 3105#L167-1 assume !(0 != main_~p8~0#1); 3100#L172-1 assume !(0 != main_~p9~0#1); 3097#L177-1 assume !(0 != main_~p10~0#1); 3093#L182-1 assume !(0 != main_~p11~0#1); 3088#L187-1 assume !(0 != main_~p12~0#1); 3085#L192-1 assume !(0 != main_~p13~0#1); 2976#L197-1 [2022-02-21 03:39:22,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:22,211 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-02-21 03:39:22,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:22,211 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599913870] [2022-02-21 03:39:22,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:22,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:22,221 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:22,229 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:22,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:22,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1180048139, now seen corresponding path program 1 times [2022-02-21 03:39:22,230 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:22,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928726476] [2022-02-21 03:39:22,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:22,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:22,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {4852#true} assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {4852#true} is VALID [2022-02-21 03:39:22,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {4852#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {4852#true} is VALID [2022-02-21 03:39:22,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {4852#true} assume !(0 != main_~p1~0#1); {4852#true} is VALID [2022-02-21 03:39:22,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {4852#true} assume !(0 != main_~p2~0#1); {4852#true} is VALID [2022-02-21 03:39:22,251 INFO L290 TraceCheckUtils]: 4: Hoare triple {4852#true} assume !(0 != main_~p3~0#1); {4852#true} is VALID [2022-02-21 03:39:22,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {4852#true} assume !(0 != main_~p4~0#1); {4852#true} is VALID [2022-02-21 03:39:22,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {4852#true} assume !(0 != main_~p5~0#1); {4852#true} is VALID [2022-02-21 03:39:22,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {4852#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:22,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:22,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:22,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:22,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:22,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p11~0#1); {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:22,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:22,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:22,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:22,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p2~0#1); {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:22,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:22,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:22,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:22,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {4854#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {4853#false} is VALID [2022-02-21 03:39:22,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {4853#false} assume !(0 != main_~p7~0#1); {4853#false} is VALID [2022-02-21 03:39:22,257 INFO L290 TraceCheckUtils]: 22: Hoare triple {4853#false} assume !(0 != main_~p8~0#1); {4853#false} is VALID [2022-02-21 03:39:22,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {4853#false} assume !(0 != main_~p9~0#1); {4853#false} is VALID [2022-02-21 03:39:22,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {4853#false} assume !(0 != main_~p10~0#1); {4853#false} is VALID [2022-02-21 03:39:22,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {4853#false} assume !(0 != main_~p11~0#1); {4853#false} is VALID [2022-02-21 03:39:22,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {4853#false} assume !(0 != main_~p12~0#1); {4853#false} is VALID [2022-02-21 03:39:22,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {4853#false} assume !(0 != main_~p13~0#1); {4853#false} is VALID [2022-02-21 03:39:22,258 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:22,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:22,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928726476] [2022-02-21 03:39:22,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928726476] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:22,258 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:22,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:22,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966869095] [2022-02-21 03:39:22,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:22,259 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:22,259 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:22,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:22,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:22,260 INFO L87 Difference]: Start difference. First operand 626 states and 978 transitions. cyclomatic complexity: 368 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:22,357 INFO L93 Difference]: Finished difference Result 1234 states and 1906 transitions. [2022-02-21 03:39:22,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:22,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:22,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1234 states and 1906 transitions. [2022-02-21 03:39:22,420 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2022-02-21 03:39:22,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1234 states to 1234 states and 1906 transitions. [2022-02-21 03:39:22,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1234 [2022-02-21 03:39:22,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1234 [2022-02-21 03:39:22,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1234 states and 1906 transitions. [2022-02-21 03:39:22,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:22,458 INFO L681 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2022-02-21 03:39:22,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states and 1906 transitions. [2022-02-21 03:39:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2022-02-21 03:39:22,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:22,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1234 states and 1906 transitions. Second operand has 1234 states, 1234 states have (on average 1.5445705024311183) internal successors, (1906), 1233 states have internal predecessors, (1906), 0 states have call successors, (0), 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,472 INFO L74 IsIncluded]: Start isIncluded. First operand 1234 states and 1906 transitions. Second operand has 1234 states, 1234 states have (on average 1.5445705024311183) internal successors, (1906), 1233 states have internal predecessors, (1906), 0 states have call successors, (0), 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,474 INFO L87 Difference]: Start difference. First operand 1234 states and 1906 transitions. Second operand has 1234 states, 1234 states have (on average 1.5445705024311183) internal successors, (1906), 1233 states have internal predecessors, (1906), 0 states have call successors, (0), 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,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:22,508 INFO L93 Difference]: Finished difference Result 1234 states and 1906 transitions. [2022-02-21 03:39:22,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1906 transitions. [2022-02-21 03:39:22,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:22,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:22,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 1234 states, 1234 states have (on average 1.5445705024311183) internal successors, (1906), 1233 states have internal predecessors, (1906), 0 states have call successors, (0), 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 1234 states and 1906 transitions. [2022-02-21 03:39:22,513 INFO L87 Difference]: Start difference. First operand has 1234 states, 1234 states have (on average 1.5445705024311183) internal successors, (1906), 1233 states have internal predecessors, (1906), 0 states have call successors, (0), 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 1234 states and 1906 transitions. [2022-02-21 03:39:22,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:22,588 INFO L93 Difference]: Finished difference Result 1234 states and 1906 transitions. [2022-02-21 03:39:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1906 transitions. [2022-02-21 03:39:22,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:22,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:22,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:22,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1234 states have (on average 1.5445705024311183) internal successors, (1906), 1233 states have internal predecessors, (1906), 0 states have call successors, (0), 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,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1906 transitions. [2022-02-21 03:39:22,642 INFO L704 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2022-02-21 03:39:22,642 INFO L587 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2022-02-21 03:39:22,642 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:39:22,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1234 states and 1906 transitions. [2022-02-21 03:39:22,646 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2022-02-21 03:39:22,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:22,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:22,647 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:22,647 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:39:22,647 INFO L791 eck$LassoCheckResult]: Stem: 6122#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); 6095#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 6096#L197-1 [2022-02-21 03:39:22,647 INFO L793 eck$LassoCheckResult]: Loop: 6096#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 6228#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 6224#L83 assume !(0 != main_~p1~0#1); 6217#L83-2 assume !(0 != main_~p2~0#1); 6212#L87-1 assume !(0 != main_~p3~0#1); 6205#L91-1 assume !(0 != main_~p4~0#1); 6197#L95-1 assume !(0 != main_~p5~0#1); 6191#L99-1 assume !(0 != main_~p6~0#1); 6186#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 6183#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 6180#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 6177#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 6174#L119-1 assume !(0 != main_~p11~0#1); 6171#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 6167#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 6168#L131-1 assume !(0 != main_~p1~0#1); 6295#L137-1 assume !(0 != main_~p2~0#1); 6291#L142-1 assume !(0 != main_~p3~0#1); 6281#L147-1 assume !(0 != main_~p4~0#1); 6276#L152-1 assume !(0 != main_~p5~0#1); 6274#L157-1 assume !(0 != main_~p6~0#1); 6273#L162-1 assume !(0 != main_~p7~0#1); 6271#L167-1 assume !(0 != main_~p8~0#1); 6264#L172-1 assume !(0 != main_~p9~0#1); 6253#L177-1 assume !(0 != main_~p10~0#1); 6245#L182-1 assume !(0 != main_~p11~0#1); 6240#L187-1 assume !(0 != main_~p12~0#1); 6237#L192-1 assume !(0 != main_~p13~0#1); 6096#L197-1 [2022-02-21 03:39:22,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:22,648 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-02-21 03:39:22,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:22,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141618032] [2022-02-21 03:39:22,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:22,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:22,652 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:22,655 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:22,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:22,656 INFO L85 PathProgramCache]: Analyzing trace with hash -757346313, now seen corresponding path program 1 times [2022-02-21 03:39:22,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:22,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019027760] [2022-02-21 03:39:22,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:22,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:22,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {9796#true} assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {9796#true} is VALID [2022-02-21 03:39:22,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {9796#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {9796#true} is VALID [2022-02-21 03:39:22,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {9796#true} assume !(0 != main_~p1~0#1); {9796#true} is VALID [2022-02-21 03:39:22,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {9796#true} assume !(0 != main_~p2~0#1); {9796#true} is VALID [2022-02-21 03:39:22,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {9796#true} assume !(0 != main_~p3~0#1); {9796#true} is VALID [2022-02-21 03:39:22,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {9796#true} assume !(0 != main_~p4~0#1); {9796#true} is VALID [2022-02-21 03:39:22,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {9796#true} assume !(0 != main_~p5~0#1); {9796#true} is VALID [2022-02-21 03:39:22,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {9796#true} assume !(0 != main_~p6~0#1); {9796#true} is VALID [2022-02-21 03:39:22,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {9796#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:22,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:22,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:22,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:22,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p11~0#1); {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:22,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:22,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:22,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p1~0#1); {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:22,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p2~0#1); {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:22,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p3~0#1); {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:22,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p4~0#1); {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:22,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p5~0#1); {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:22,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p6~0#1); {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:22,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {9798#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p7~0#1); {9797#false} is VALID [2022-02-21 03:39:22,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {9797#false} assume !(0 != main_~p8~0#1); {9797#false} is VALID [2022-02-21 03:39:22,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {9797#false} assume !(0 != main_~p9~0#1); {9797#false} is VALID [2022-02-21 03:39:22,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {9797#false} assume !(0 != main_~p10~0#1); {9797#false} is VALID [2022-02-21 03:39:22,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {9797#false} assume !(0 != main_~p11~0#1); {9797#false} is VALID [2022-02-21 03:39:22,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {9797#false} assume !(0 != main_~p12~0#1); {9797#false} is VALID [2022-02-21 03:39:22,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {9797#false} assume !(0 != main_~p13~0#1); {9797#false} is VALID [2022-02-21 03:39:22,680 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:22,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:22,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019027760] [2022-02-21 03:39:22,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019027760] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:22,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:22,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:22,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771850689] [2022-02-21 03:39:22,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:22,682 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:22,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:22,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:22,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:22,683 INFO L87 Difference]: Start difference. First operand 1234 states and 1906 transitions. cyclomatic complexity: 704 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:22,867 INFO L93 Difference]: Finished difference Result 2434 states and 3714 transitions. [2022-02-21 03:39:22,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:22,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:22,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2434 states and 3714 transitions. [2022-02-21 03:39:23,015 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2022-02-21 03:39:23,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2434 states to 2434 states and 3714 transitions. [2022-02-21 03:39:23,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2434 [2022-02-21 03:39:23,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2434 [2022-02-21 03:39:23,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2434 states and 3714 transitions. [2022-02-21 03:39:23,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:23,144 INFO L681 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2022-02-21 03:39:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states and 3714 transitions. [2022-02-21 03:39:23,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2022-02-21 03:39:23,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:23,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2434 states and 3714 transitions. Second operand has 2434 states, 2434 states have (on average 1.5258833196384551) internal successors, (3714), 2433 states have internal predecessors, (3714), 0 states have call successors, (0), 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,192 INFO L74 IsIncluded]: Start isIncluded. First operand 2434 states and 3714 transitions. Second operand has 2434 states, 2434 states have (on average 1.5258833196384551) internal successors, (3714), 2433 states have internal predecessors, (3714), 0 states have call successors, (0), 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,195 INFO L87 Difference]: Start difference. First operand 2434 states and 3714 transitions. Second operand has 2434 states, 2434 states have (on average 1.5258833196384551) internal successors, (3714), 2433 states have internal predecessors, (3714), 0 states have call successors, (0), 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,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:23,315 INFO L93 Difference]: Finished difference Result 2434 states and 3714 transitions. [2022-02-21 03:39:23,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3714 transitions. [2022-02-21 03:39:23,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:23,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:23,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 2434 states, 2434 states have (on average 1.5258833196384551) internal successors, (3714), 2433 states have internal predecessors, (3714), 0 states have call successors, (0), 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 2434 states and 3714 transitions. [2022-02-21 03:39:23,324 INFO L87 Difference]: Start difference. First operand has 2434 states, 2434 states have (on average 1.5258833196384551) internal successors, (3714), 2433 states have internal predecessors, (3714), 0 states have call successors, (0), 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 2434 states and 3714 transitions. [2022-02-21 03:39:23,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:23,451 INFO L93 Difference]: Finished difference Result 2434 states and 3714 transitions. [2022-02-21 03:39:23,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3714 transitions. [2022-02-21 03:39:23,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:23,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:23,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:23,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2434 states have (on average 1.5258833196384551) internal successors, (3714), 2433 states have internal predecessors, (3714), 0 states have call successors, (0), 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,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3714 transitions. [2022-02-21 03:39:23,582 INFO L704 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2022-02-21 03:39:23,582 INFO L587 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2022-02-21 03:39:23,582 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:39:23,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2434 states and 3714 transitions. [2022-02-21 03:39:23,589 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2022-02-21 03:39:23,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:23,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:23,590 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:23,590 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:39:23,590 INFO L791 eck$LassoCheckResult]: Stem: 12269#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); 12239#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 12240#L197-1 [2022-02-21 03:39:23,590 INFO L793 eck$LassoCheckResult]: Loop: 12240#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 12482#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 12481#L83 assume !(0 != main_~p1~0#1); 12450#L83-2 assume !(0 != main_~p2~0#1); 12447#L87-1 assume !(0 != main_~p3~0#1); 12439#L91-1 assume !(0 != main_~p4~0#1); 12388#L95-1 assume !(0 != main_~p5~0#1); 12347#L99-1 assume !(0 != main_~p6~0#1); 12348#L103-1 assume !(0 != main_~p7~0#1); 12588#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 12583#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 12581#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 12579#L119-1 assume !(0 != main_~p11~0#1); 12575#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 12569#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 12562#L131-1 assume !(0 != main_~p1~0#1); 12511#L137-1 assume !(0 != main_~p2~0#1); 12508#L142-1 assume !(0 != main_~p3~0#1); 12505#L147-1 assume !(0 != main_~p4~0#1); 12503#L152-1 assume !(0 != main_~p5~0#1); 12501#L157-1 assume !(0 != main_~p6~0#1); 12499#L162-1 assume !(0 != main_~p7~0#1); 12498#L167-1 assume !(0 != main_~p8~0#1); 12495#L172-1 assume !(0 != main_~p9~0#1); 12494#L177-1 assume !(0 != main_~p10~0#1); 12492#L182-1 assume !(0 != main_~p11~0#1); 12489#L187-1 assume !(0 != main_~p12~0#1); 12488#L192-1 assume !(0 != main_~p13~0#1); 12240#L197-1 [2022-02-21 03:39:23,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:23,591 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-02-21 03:39:23,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:23,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520279601] [2022-02-21 03:39:23,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:23,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:23,595 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:23,597 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:23,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:23,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1574994763, now seen corresponding path program 1 times [2022-02-21 03:39:23,598 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:23,598 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689269541] [2022-02-21 03:39:23,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:23,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:23,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {19540#true} assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {19540#true} is VALID [2022-02-21 03:39:23,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {19540#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {19540#true} is VALID [2022-02-21 03:39:23,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {19540#true} assume !(0 != main_~p1~0#1); {19540#true} is VALID [2022-02-21 03:39:23,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {19540#true} assume !(0 != main_~p2~0#1); {19540#true} is VALID [2022-02-21 03:39:23,614 INFO L290 TraceCheckUtils]: 4: Hoare triple {19540#true} assume !(0 != main_~p3~0#1); {19540#true} is VALID [2022-02-21 03:39:23,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {19540#true} assume !(0 != main_~p4~0#1); {19540#true} is VALID [2022-02-21 03:39:23,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {19540#true} assume !(0 != main_~p5~0#1); {19540#true} is VALID [2022-02-21 03:39:23,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {19540#true} assume !(0 != main_~p6~0#1); {19540#true} is VALID [2022-02-21 03:39:23,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {19540#true} assume !(0 != main_~p7~0#1); {19540#true} is VALID [2022-02-21 03:39:23,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {19540#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:23,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:23,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:23,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p11~0#1); {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:23,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:23,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:23,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p1~0#1); {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:23,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p2~0#1); {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:23,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p3~0#1); {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:23,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p4~0#1); {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:23,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p5~0#1); {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:23,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p6~0#1); {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:23,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p7~0#1); {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:23,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {19542#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p8~0#1); {19541#false} is VALID [2022-02-21 03:39:23,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {19541#false} assume !(0 != main_~p9~0#1); {19541#false} is VALID [2022-02-21 03:39:23,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {19541#false} assume !(0 != main_~p10~0#1); {19541#false} is VALID [2022-02-21 03:39:23,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {19541#false} assume !(0 != main_~p11~0#1); {19541#false} is VALID [2022-02-21 03:39:23,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {19541#false} assume !(0 != main_~p12~0#1); {19541#false} is VALID [2022-02-21 03:39:23,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {19541#false} assume !(0 != main_~p13~0#1); {19541#false} is VALID [2022-02-21 03:39:23,620 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:23,620 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:23,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689269541] [2022-02-21 03:39:23,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689269541] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:23,620 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:23,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:23,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014087680] [2022-02-21 03:39:23,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:23,621 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:23,621 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:23,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:23,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:23,622 INFO L87 Difference]: Start difference. First operand 2434 states and 3714 transitions. cyclomatic complexity: 1344 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:24,141 INFO L93 Difference]: Finished difference Result 4802 states and 7234 transitions. [2022-02-21 03:39:24,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:24,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:24,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4802 states and 7234 transitions. [2022-02-21 03:39:24,628 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2022-02-21 03:39:25,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4802 states to 4802 states and 7234 transitions. [2022-02-21 03:39:25,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4802 [2022-02-21 03:39:25,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4802 [2022-02-21 03:39:25,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4802 states and 7234 transitions. [2022-02-21 03:39:25,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:25,099 INFO L681 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2022-02-21 03:39:25,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states and 7234 transitions. [2022-02-21 03:39:25,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 4802. [2022-02-21 03:39:25,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:25,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4802 states and 7234 transitions. Second operand has 4802 states, 4802 states have (on average 1.5064556434818825) internal successors, (7234), 4801 states have internal predecessors, (7234), 0 states have call successors, (0), 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:25,156 INFO L74 IsIncluded]: Start isIncluded. First operand 4802 states and 7234 transitions. Second operand has 4802 states, 4802 states have (on average 1.5064556434818825) internal successors, (7234), 4801 states have internal predecessors, (7234), 0 states have call successors, (0), 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:25,161 INFO L87 Difference]: Start difference. First operand 4802 states and 7234 transitions. Second operand has 4802 states, 4802 states have (on average 1.5064556434818825) internal successors, (7234), 4801 states have internal predecessors, (7234), 0 states have call successors, (0), 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:25,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:25,650 INFO L93 Difference]: Finished difference Result 4802 states and 7234 transitions. [2022-02-21 03:39:25,650 INFO L276 IsEmpty]: Start isEmpty. Operand 4802 states and 7234 transitions. [2022-02-21 03:39:25,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:25,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:25,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 4802 states, 4802 states have (on average 1.5064556434818825) internal successors, (7234), 4801 states have internal predecessors, (7234), 0 states have call successors, (0), 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 4802 states and 7234 transitions. [2022-02-21 03:39:25,664 INFO L87 Difference]: Start difference. First operand has 4802 states, 4802 states have (on average 1.5064556434818825) internal successors, (7234), 4801 states have internal predecessors, (7234), 0 states have call successors, (0), 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 4802 states and 7234 transitions. [2022-02-21 03:39:26,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:26,128 INFO L93 Difference]: Finished difference Result 4802 states and 7234 transitions. [2022-02-21 03:39:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 4802 states and 7234 transitions. [2022-02-21 03:39:26,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:26,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:26,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:26,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4802 states, 4802 states have (on average 1.5064556434818825) internal successors, (7234), 4801 states have internal predecessors, (7234), 0 states have call successors, (0), 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,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7234 transitions. [2022-02-21 03:39:26,630 INFO L704 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2022-02-21 03:39:26,630 INFO L587 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2022-02-21 03:39:26,630 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:39:26,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4802 states and 7234 transitions. [2022-02-21 03:39:26,655 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2022-02-21 03:39:26,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:26,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:26,656 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:26,656 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:39:26,656 INFO L791 eck$LassoCheckResult]: Stem: 24380#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); 24351#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 24352#L197-1 [2022-02-21 03:39:26,657 INFO L793 eck$LassoCheckResult]: Loop: 24352#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 24780#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 24777#L83 assume !(0 != main_~p1~0#1); 24773#L83-2 assume !(0 != main_~p2~0#1); 24770#L87-1 assume !(0 != main_~p3~0#1); 24767#L91-1 assume !(0 != main_~p4~0#1); 24763#L95-1 assume !(0 != main_~p5~0#1); 24759#L99-1 assume !(0 != main_~p6~0#1); 24760#L103-1 assume !(0 != main_~p7~0#1); 24838#L107-1 assume !(0 != main_~p8~0#1); 24836#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 24834#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 24832#L119-1 assume !(0 != main_~p11~0#1); 24830#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 24828#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 24825#L131-1 assume !(0 != main_~p1~0#1); 24821#L137-1 assume !(0 != main_~p2~0#1); 24818#L142-1 assume !(0 != main_~p3~0#1); 24813#L147-1 assume !(0 != main_~p4~0#1); 24809#L152-1 assume !(0 != main_~p5~0#1); 24807#L157-1 assume !(0 != main_~p6~0#1); 24806#L162-1 assume !(0 != main_~p7~0#1); 24804#L167-1 assume !(0 != main_~p8~0#1); 24800#L172-1 assume !(0 != main_~p9~0#1); 24797#L177-1 assume !(0 != main_~p10~0#1); 24793#L182-1 assume !(0 != main_~p11~0#1); 24788#L187-1 assume !(0 != main_~p12~0#1); 24785#L192-1 assume !(0 != main_~p13~0#1); 24352#L197-1 [2022-02-21 03:39:26,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:26,657 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-02-21 03:39:26,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:26,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890936063] [2022-02-21 03:39:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:26,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:26,661 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:26,664 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:26,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:26,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1031028791, now seen corresponding path program 1 times [2022-02-21 03:39:26,665 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:26,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462462725] [2022-02-21 03:39:26,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:26,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:26,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {38756#true} assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {38756#true} is VALID [2022-02-21 03:39:26,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {38756#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {38756#true} is VALID [2022-02-21 03:39:26,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {38756#true} assume !(0 != main_~p1~0#1); {38756#true} is VALID [2022-02-21 03:39:26,682 INFO L290 TraceCheckUtils]: 3: Hoare triple {38756#true} assume !(0 != main_~p2~0#1); {38756#true} is VALID [2022-02-21 03:39:26,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {38756#true} assume !(0 != main_~p3~0#1); {38756#true} is VALID [2022-02-21 03:39:26,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {38756#true} assume !(0 != main_~p4~0#1); {38756#true} is VALID [2022-02-21 03:39:26,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {38756#true} assume !(0 != main_~p5~0#1); {38756#true} is VALID [2022-02-21 03:39:26,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {38756#true} assume !(0 != main_~p6~0#1); {38756#true} is VALID [2022-02-21 03:39:26,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {38756#true} assume !(0 != main_~p7~0#1); {38756#true} is VALID [2022-02-21 03:39:26,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {38756#true} assume !(0 != main_~p8~0#1); {38756#true} is VALID [2022-02-21 03:39:26,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {38756#true} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:26,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:26,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p11~0#1); {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:26,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:26,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:26,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p1~0#1); {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:26,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p2~0#1); {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:26,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p3~0#1); {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:26,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p4~0#1); {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:26,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p5~0#1); {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:26,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p6~0#1); {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:26,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p7~0#1); {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:26,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p8~0#1); {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:26,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {38758#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p9~0#1); {38757#false} is VALID [2022-02-21 03:39:26,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {38757#false} assume !(0 != main_~p10~0#1); {38757#false} is VALID [2022-02-21 03:39:26,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {38757#false} assume !(0 != main_~p11~0#1); {38757#false} is VALID [2022-02-21 03:39:26,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {38757#false} assume !(0 != main_~p12~0#1); {38757#false} is VALID [2022-02-21 03:39:26,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {38757#false} assume !(0 != main_~p13~0#1); {38757#false} is VALID [2022-02-21 03:39:26,688 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:26,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:26,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462462725] [2022-02-21 03:39:26,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462462725] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:26,689 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:26,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:26,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238303476] [2022-02-21 03:39:26,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:26,689 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:26,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:26,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:26,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:26,690 INFO L87 Difference]: Start difference. First operand 4802 states and 7234 transitions. cyclomatic complexity: 2560 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:28,562 INFO L93 Difference]: Finished difference Result 9474 states and 14082 transitions. [2022-02-21 03:39:28,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:28,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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:28,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:28,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9474 states and 14082 transitions. [2022-02-21 03:39:30,468 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2022-02-21 03:39:32,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9474 states to 9474 states and 14082 transitions. [2022-02-21 03:39:32,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9474 [2022-02-21 03:39:32,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9474 [2022-02-21 03:39:32,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9474 states and 14082 transitions. [2022-02-21 03:39:32,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:32,298 INFO L681 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2022-02-21 03:39:32,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states and 14082 transitions. [2022-02-21 03:39:32,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 9474. [2022-02-21 03:39:32,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:32,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9474 states and 14082 transitions. Second operand has 9474 states, 9474 states have (on average 1.486383787207093) internal successors, (14082), 9473 states have internal predecessors, (14082), 0 states have call successors, (0), 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:32,420 INFO L74 IsIncluded]: Start isIncluded. First operand 9474 states and 14082 transitions. Second operand has 9474 states, 9474 states have (on average 1.486383787207093) internal successors, (14082), 9473 states have internal predecessors, (14082), 0 states have call successors, (0), 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:32,428 INFO L87 Difference]: Start difference. First operand 9474 states and 14082 transitions. Second operand has 9474 states, 9474 states have (on average 1.486383787207093) internal successors, (14082), 9473 states have internal predecessors, (14082), 0 states have call successors, (0), 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:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:34,197 INFO L93 Difference]: Finished difference Result 9474 states and 14082 transitions. [2022-02-21 03:39:34,197 INFO L276 IsEmpty]: Start isEmpty. Operand 9474 states and 14082 transitions. [2022-02-21 03:39:34,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:34,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:34,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 9474 states, 9474 states have (on average 1.486383787207093) internal successors, (14082), 9473 states have internal predecessors, (14082), 0 states have call successors, (0), 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 9474 states and 14082 transitions. [2022-02-21 03:39:34,224 INFO L87 Difference]: Start difference. First operand has 9474 states, 9474 states have (on average 1.486383787207093) internal successors, (14082), 9473 states have internal predecessors, (14082), 0 states have call successors, (0), 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 9474 states and 14082 transitions. [2022-02-21 03:39:36,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:36,030 INFO L93 Difference]: Finished difference Result 9474 states and 14082 transitions. [2022-02-21 03:39:36,031 INFO L276 IsEmpty]: Start isEmpty. Operand 9474 states and 14082 transitions. [2022-02-21 03:39:36,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:36,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:36,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:36,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:36,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9474 states, 9474 states have (on average 1.486383787207093) internal successors, (14082), 9473 states have internal predecessors, (14082), 0 states have call successors, (0), 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:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9474 states to 9474 states and 14082 transitions. [2022-02-21 03:39:37,939 INFO L704 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2022-02-21 03:39:37,939 INFO L587 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2022-02-21 03:39:37,939 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:39:37,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9474 states and 14082 transitions. [2022-02-21 03:39:37,972 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2022-02-21 03:39:37,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:37,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:37,973 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:37,973 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:39:37,973 INFO L791 eck$LassoCheckResult]: Stem: 48265#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); 48239#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 48240#L197-1 [2022-02-21 03:39:37,974 INFO L793 eck$LassoCheckResult]: Loop: 48240#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 48970#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 49107#L83 assume !(0 != main_~p1~0#1); 49104#L83-2 assume !(0 != main_~p2~0#1); 48947#L87-1 assume !(0 != main_~p3~0#1); 48939#L91-1 assume !(0 != main_~p4~0#1); 48941#L95-1 assume !(0 != main_~p5~0#1); 49083#L99-1 assume !(0 != main_~p6~0#1); 49074#L103-1 assume !(0 != main_~p7~0#1); 49075#L107-1 assume !(0 != main_~p8~0#1); 49136#L111-1 assume !(0 != main_~p9~0#1); 49079#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 49077#L119-1 assume !(0 != main_~p11~0#1); 49051#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 49049#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 49046#L131-1 assume !(0 != main_~p1~0#1); 49043#L137-1 assume !(0 != main_~p2~0#1); 49041#L142-1 assume !(0 != main_~p3~0#1); 48825#L147-1 assume !(0 != main_~p4~0#1); 48818#L152-1 assume !(0 != main_~p5~0#1); 48747#L157-1 assume !(0 != main_~p6~0#1); 48749#L162-1 assume !(0 != main_~p7~0#1); 49017#L167-1 assume !(0 != main_~p8~0#1); 49144#L172-1 assume !(0 != main_~p9~0#1); 49001#L177-1 assume !(0 != main_~p10~0#1); 48995#L182-1 assume !(0 != main_~p11~0#1); 48988#L187-1 assume !(0 != main_~p12~0#1); 48977#L192-1 assume !(0 != main_~p13~0#1); 48240#L197-1 [2022-02-21 03:39:37,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:37,975 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-02-21 03:39:37,975 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:37,975 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563317760] [2022-02-21 03:39:37,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:37,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:37,980 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:37,984 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:37,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:37,984 INFO L85 PathProgramCache]: Analyzing trace with hash -963115915, now seen corresponding path program 1 times [2022-02-21 03:39:37,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:37,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530852175] [2022-02-21 03:39:37,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:37,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:38,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {76660#true} assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {76660#true} is VALID [2022-02-21 03:39:38,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {76660#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {76660#true} is VALID [2022-02-21 03:39:38,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {76660#true} assume !(0 != main_~p1~0#1); {76660#true} is VALID [2022-02-21 03:39:38,019 INFO L290 TraceCheckUtils]: 3: Hoare triple {76660#true} assume !(0 != main_~p2~0#1); {76660#true} is VALID [2022-02-21 03:39:38,019 INFO L290 TraceCheckUtils]: 4: Hoare triple {76660#true} assume !(0 != main_~p3~0#1); {76660#true} is VALID [2022-02-21 03:39:38,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {76660#true} assume !(0 != main_~p4~0#1); {76660#true} is VALID [2022-02-21 03:39:38,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {76660#true} assume !(0 != main_~p5~0#1); {76660#true} is VALID [2022-02-21 03:39:38,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {76660#true} assume !(0 != main_~p6~0#1); {76660#true} is VALID [2022-02-21 03:39:38,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {76660#true} assume !(0 != main_~p7~0#1); {76660#true} is VALID [2022-02-21 03:39:38,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {76660#true} assume !(0 != main_~p8~0#1); {76660#true} is VALID [2022-02-21 03:39:38,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {76660#true} assume !(0 != main_~p9~0#1); {76660#true} is VALID [2022-02-21 03:39:38,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {76660#true} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:38,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p11~0#1); {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:38,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:38,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:38,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p1~0#1); {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:38,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p2~0#1); {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:38,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p3~0#1); {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:38,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p4~0#1); {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:38,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p5~0#1); {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:38,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p6~0#1); {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:38,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p7~0#1); {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:38,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p8~0#1); {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:38,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p9~0#1); {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:38,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {76662#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p10~0#1); {76661#false} is VALID [2022-02-21 03:39:38,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {76661#false} assume !(0 != main_~p11~0#1); {76661#false} is VALID [2022-02-21 03:39:38,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {76661#false} assume !(0 != main_~p12~0#1); {76661#false} is VALID [2022-02-21 03:39:38,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {76661#false} assume !(0 != main_~p13~0#1); {76661#false} is VALID [2022-02-21 03:39:38,031 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:38,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:38,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530852175] [2022-02-21 03:39:38,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530852175] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:38,032 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:38,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:38,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635447780] [2022-02-21 03:39:38,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:38,033 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:38,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:38,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:38,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:38,034 INFO L87 Difference]: Start difference. First operand 9474 states and 14082 transitions. cyclomatic complexity: 4864 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:45,407 INFO L93 Difference]: Finished difference Result 18690 states and 27394 transitions. [2022-02-21 03:39:45,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:45,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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:45,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:45,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18690 states and 27394 transitions. [2022-02-21 03:39:52,390 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2022-02-21 03:39:59,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18690 states to 18690 states and 27394 transitions. [2022-02-21 03:39:59,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18690 [2022-02-21 03:39:59,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18690 [2022-02-21 03:39:59,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18690 states and 27394 transitions. [2022-02-21 03:39:59,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:59,289 INFO L681 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2022-02-21 03:39:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18690 states and 27394 transitions. [2022-02-21 03:39:59,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18690 to 18690. [2022-02-21 03:39:59,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:59,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18690 states and 27394 transitions. Second operand has 18690 states, 18690 states have (on average 1.4657035848047084) internal successors, (27394), 18689 states have internal predecessors, (27394), 0 states have call successors, (0), 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,601 INFO L74 IsIncluded]: Start isIncluded. First operand 18690 states and 27394 transitions. Second operand has 18690 states, 18690 states have (on average 1.4657035848047084) internal successors, (27394), 18689 states have internal predecessors, (27394), 0 states have call successors, (0), 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,639 INFO L87 Difference]: Start difference. First operand 18690 states and 27394 transitions. Second operand has 18690 states, 18690 states have (on average 1.4657035848047084) internal successors, (27394), 18689 states have internal predecessors, (27394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:40:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:06,762 INFO L93 Difference]: Finished difference Result 18690 states and 27394 transitions. [2022-02-21 03:40:06,762 INFO L276 IsEmpty]: Start isEmpty. Operand 18690 states and 27394 transitions. [2022-02-21 03:40:06,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:40:06,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:40:06,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 18690 states, 18690 states have (on average 1.4657035848047084) internal successors, (27394), 18689 states have internal predecessors, (27394), 0 states have call successors, (0), 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 18690 states and 27394 transitions. [2022-02-21 03:40:06,843 INFO L87 Difference]: Start difference. First operand has 18690 states, 18690 states have (on average 1.4657035848047084) internal successors, (27394), 18689 states have internal predecessors, (27394), 0 states have call successors, (0), 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 18690 states and 27394 transitions. [2022-02-21 03:40:13,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:13,972 INFO L93 Difference]: Finished difference Result 18690 states and 27394 transitions. [2022-02-21 03:40:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 18690 states and 27394 transitions. [2022-02-21 03:40:13,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:40:13,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:40:13,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:40:13,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:40:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18690 states, 18690 states have (on average 1.4657035848047084) internal successors, (27394), 18689 states have internal predecessors, (27394), 0 states have call successors, (0), 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:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18690 states to 18690 states and 27394 transitions. [2022-02-21 03:40:21,419 INFO L704 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2022-02-21 03:40:21,419 INFO L587 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2022-02-21 03:40:21,419 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 03:40:21,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18690 states and 27394 transitions. [2022-02-21 03:40:21,476 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2022-02-21 03:40:21,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:40:21,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:40:21,478 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:40:21,478 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:40:21,479 INFO L791 eck$LassoCheckResult]: Stem: 95388#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); 95359#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 95360#L197-1 [2022-02-21 03:40:21,479 INFO L793 eck$LassoCheckResult]: Loop: 95360#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 95528#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 95524#L83 assume !(0 != main_~p1~0#1); 95521#L83-2 assume !(0 != main_~p2~0#1); 95518#L87-1 assume !(0 != main_~p3~0#1); 95514#L91-1 assume !(0 != main_~p4~0#1); 95510#L95-1 assume !(0 != main_~p5~0#1); 95506#L99-1 assume !(0 != main_~p6~0#1); 95501#L103-1 assume !(0 != main_~p7~0#1); 95496#L107-1 assume !(0 != main_~p8~0#1); 95497#L111-1 assume !(0 != main_~p9~0#1); 95819#L115-1 assume !(0 != main_~p10~0#1); 95815#L119-1 assume !(0 != main_~p11~0#1); 95811#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 95806#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 95799#L131-1 assume !(0 != main_~p1~0#1); 95792#L137-1 assume !(0 != main_~p2~0#1); 95774#L142-1 assume !(0 != main_~p3~0#1); 95755#L147-1 assume !(0 != main_~p4~0#1); 95751#L152-1 assume !(0 != main_~p5~0#1); 95747#L157-1 assume !(0 != main_~p6~0#1); 95745#L162-1 assume !(0 != main_~p7~0#1); 95733#L167-1 assume !(0 != main_~p8~0#1); 95731#L172-1 assume !(0 != main_~p9~0#1); 95730#L177-1 assume !(0 != main_~p10~0#1); 95729#L182-1 assume !(0 != main_~p11~0#1); 95533#L187-1 assume !(0 != main_~p12~0#1); 95532#L192-1 assume !(0 != main_~p13~0#1); 95360#L197-1 [2022-02-21 03:40:21,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:40:21,480 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-02-21 03:40:21,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:40:21,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015334841] [2022-02-21 03:40:21,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:40:21,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:40:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:40:21,510 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:40:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:40:21,521 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:40:21,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:40:21,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1743503479, now seen corresponding path program 1 times [2022-02-21 03:40:21,521 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:40:21,521 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688769632] [2022-02-21 03:40:21,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:40:21,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:40:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:40:21,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {151428#true} assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {151428#true} is VALID [2022-02-21 03:40:21,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {151428#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {151428#true} is VALID [2022-02-21 03:40:21,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {151428#true} assume !(0 != main_~p1~0#1); {151428#true} is VALID [2022-02-21 03:40:21,549 INFO L290 TraceCheckUtils]: 3: Hoare triple {151428#true} assume !(0 != main_~p2~0#1); {151428#true} is VALID [2022-02-21 03:40:21,549 INFO L290 TraceCheckUtils]: 4: Hoare triple {151428#true} assume !(0 != main_~p3~0#1); {151428#true} is VALID [2022-02-21 03:40:21,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {151428#true} assume !(0 != main_~p4~0#1); {151428#true} is VALID [2022-02-21 03:40:21,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {151428#true} assume !(0 != main_~p5~0#1); {151428#true} is VALID [2022-02-21 03:40:21,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {151428#true} assume !(0 != main_~p6~0#1); {151428#true} is VALID [2022-02-21 03:40:21,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {151428#true} assume !(0 != main_~p7~0#1); {151428#true} is VALID [2022-02-21 03:40:21,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {151428#true} assume !(0 != main_~p8~0#1); {151428#true} is VALID [2022-02-21 03:40:21,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {151428#true} assume !(0 != main_~p9~0#1); {151428#true} is VALID [2022-02-21 03:40:21,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {151428#true} assume !(0 != main_~p10~0#1); {151428#true} is VALID [2022-02-21 03:40:21,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {151428#true} assume !(0 != main_~p11~0#1); {151428#true} is VALID [2022-02-21 03:40:21,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {151428#true} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:21,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:21,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p1~0#1); {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:21,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p2~0#1); {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:21,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p3~0#1); {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:21,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p4~0#1); {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:21,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p5~0#1); {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:21,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p6~0#1); {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:21,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p7~0#1); {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:21,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p8~0#1); {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:21,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p9~0#1); {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:21,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p10~0#1); {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:21,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p11~0#1); {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} is VALID [2022-02-21 03:40:21,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {151430#(not (= |ULTIMATE.start_main_~p12~0#1| 0))} assume !(0 != main_~p12~0#1); {151429#false} is VALID [2022-02-21 03:40:21,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {151429#false} assume !(0 != main_~p13~0#1); {151429#false} is VALID [2022-02-21 03:40:21,554 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:21,554 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:40:21,554 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688769632] [2022-02-21 03:40:21,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688769632] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:40:21,555 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:40:21,555 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:40:21,555 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556060992] [2022-02-21 03:40:21,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:40:21,555 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:40:21,555 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:40:21,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:40:21,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:40:21,556 INFO L87 Difference]: Start difference. First operand 18690 states and 27394 transitions. cyclomatic complexity: 9216 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)