./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_14-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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_14-2.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 7dd19b8066311da8c1eb1c6a0e6567bb02c0b787 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 02:02:40,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 02:02:40,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 02:02:40,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 02:02:40,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 02:02:40,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 02:02:40,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 02:02:40,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 02:02:40,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 02:02:40,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 02:02:40,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 02:02:40,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 02:02:40,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 02:02:40,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 02:02:40,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 02:02:40,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 02:02:40,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 02:02:40,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 02:02:40,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 02:02:40,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 02:02:40,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 02:02:40,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 02:02:40,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 02:02:40,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 02:02:40,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 02:02:40,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 02:02:40,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 02:02:40,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 02:02:40,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 02:02:40,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 02:02:40,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 02:02:40,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 02:02:40,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 02:02:40,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 02:02:40,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 02:02:40,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 02:02:40,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 02:02:40,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 02:02:40,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 02:02:40,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 02:02:40,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 02:02:40,244 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 02:02:40,264 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 02:02:40,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 02:02:40,265 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 02:02:40,265 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 02:02:40,266 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 02:02:40,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 02:02:40,266 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 02:02:40,266 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 02:02:40,267 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 02:02:40,267 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 02:02:40,267 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 02:02:40,267 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 02:02:40,267 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 02:02:40,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 02:02:40,268 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 02:02:40,268 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 02:02:40,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 02:02:40,268 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 02:02:40,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 02:02:40,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 02:02:40,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 02:02:40,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 02:02:40,269 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 02:02:40,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 02:02:40,269 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 02:02:40,269 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 02:02:40,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 02:02:40,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 02:02:40,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 02:02:40,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 02:02:40,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 02:02:40,271 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 02:02:40,272 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 02:02:40,272 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 -> 7dd19b8066311da8c1eb1c6a0e6567bb02c0b787 [2021-08-31 02:02:40,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 02:02:40,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 02:02:40,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 02:02:40,603 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 02:02:40,604 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 02:02:40,606 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-2.c [2021-08-31 02:02:40,686 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b918169c6/7cea9c9632cf4e0bbdfda0ee72b1b8ce/FLAG00c6ca68f [2021-08-31 02:02:41,092 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 02:02:41,094 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2021-08-31 02:02:41,102 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b918169c6/7cea9c9632cf4e0bbdfda0ee72b1b8ce/FLAG00c6ca68f [2021-08-31 02:02:41,504 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b918169c6/7cea9c9632cf4e0bbdfda0ee72b1b8ce [2021-08-31 02:02:41,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 02:02:41,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 02:02:41,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 02:02:41,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 02:02:41,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 02:02:41,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:02:41" (1/1) ... [2021-08-31 02:02:41,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c32ab1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:41, skipping insertion in model container [2021-08-31 02:02:41,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:02:41" (1/1) ... [2021-08-31 02:02:41,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 02:02:41,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 02:02:41,692 WARN L228 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_14-2.c[5305,5318] [2021-08-31 02:02:41,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 02:02:41,708 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 02:02:41,779 WARN L228 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_14-2.c[5305,5318] [2021-08-31 02:02:41,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 02:02:41,791 INFO L208 MainTranslator]: Completed translation [2021-08-31 02:02:41,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:41 WrapperNode [2021-08-31 02:02:41,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 02:02:41,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 02:02:41,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 02:02:41,793 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 02:02:41,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:41" (1/1) ... [2021-08-31 02:02:41,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:41" (1/1) ... [2021-08-31 02:02:41,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 02:02:41,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 02:02:41,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 02:02:41,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 02:02:41,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:41" (1/1) ... [2021-08-31 02:02:41,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:41" (1/1) ... [2021-08-31 02:02:41,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:41" (1/1) ... [2021-08-31 02:02:41,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:41" (1/1) ... [2021-08-31 02:02:41,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:41" (1/1) ... [2021-08-31 02:02:41,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:41" (1/1) ... [2021-08-31 02:02:41,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:41" (1/1) ... [2021-08-31 02:02:41,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 02:02:41,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 02:02:41,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 02:02:41,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 02:02:41,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:41" (1/1) ... [2021-08-31 02:02:41,871 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:02:41,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:02:41,895 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) [2021-08-31 02:02:41,919 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 [2021-08-31 02:02:41,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 02:02:41,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 02:02:41,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 02:02:41,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 02:02:42,096 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 02:02:42,096 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-31 02:02:42,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:02:42 BoogieIcfgContainer [2021-08-31 02:02:42,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 02:02:42,099 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 02:02:42,099 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 02:02:42,101 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 02:02:42,102 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:02:42,102 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 02:02:41" (1/3) ... [2021-08-31 02:02:42,103 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f10a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 02:02:42, skipping insertion in model container [2021-08-31 02:02:42,103 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:02:42,103 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:41" (2/3) ... [2021-08-31 02:02:42,104 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f10a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 02:02:42, skipping insertion in model container [2021-08-31 02:02:42,104 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:02:42,104 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:02:42" (3/3) ... [2021-08-31 02:02:42,105 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_14-2.c [2021-08-31 02:02:42,141 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 02:02:42,141 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 02:02:42,141 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 02:02:42,141 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 02:02:42,142 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 02:02:42,142 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 02:02:42,142 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 02:02:42,142 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 02:02:42,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:42,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-08-31 02:02:42,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:42,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:42,176 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:42,176 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:42,176 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 02:02:42,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:42,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-08-31 02:02:42,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:42,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:42,181 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:42,181 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:42,189 INFO L791 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 35#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 32#L211true [2021-08-31 02:02:42,190 INFO L793 eck$LassoCheckResult]: Loop: 32#L211true assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 46#L55true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 23#L88true assume 0 != main_~p1~0;main_~lk1~0 := 1; 12#L88-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 33#L92-1true assume !(0 != main_~p3~0); 4#L96-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 7#L100-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 49#L104-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 13#L108-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 52#L112-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 27#L116-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 39#L120-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 34#L124-1true assume !(0 != main_~p11~0); 17#L128-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 47#L132-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 42#L136-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 38#L140-1true assume !(0 != main_~p1~0); 18#L146-1true assume 0 != main_~p2~0; 28#L152true assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 14#L151true assume !(0 != main_~p3~0); 29#L156-1true assume !(0 != main_~p4~0); 5#L161-1true assume !(0 != main_~p5~0); 11#L166-1true assume !(0 != main_~p6~0); 25#L171-1true assume !(0 != main_~p7~0); 21#L176-1true assume !(0 != main_~p8~0); 50#L181-1true assume !(0 != main_~p9~0); 22#L186-1true assume !(0 != main_~p10~0); 37#L191-1true assume !(0 != main_~p11~0); 51#L196-1true assume !(0 != main_~p12~0); 26#L201-1true assume !(0 != main_~p13~0); 15#L206-1true assume 0 != main_~p14~0; 9#L212true assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 32#L211true [2021-08-31 02:02:42,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:42,195 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-31 02:02:42,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:42,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174995502] [2021-08-31 02:02:42,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:42,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:42,293 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:42,347 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:42,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:42,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1237702727, now seen corresponding path program 1 times [2021-08-31 02:02:42,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:42,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228598792] [2021-08-31 02:02:42,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:42,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:42,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:42,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228598792] [2021-08-31 02:02:42,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228598792] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:42,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:42,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:42,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041923635] [2021-08-31 02:02:42,443 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:42,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:42,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:42,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:42,517 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 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 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:42,833 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2021-08-31 02:02:42,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:42,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 178 transitions. [2021-08-31 02:02:42,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2021-08-31 02:02:42,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 89 states and 139 transitions. [2021-08-31 02:02:42,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2021-08-31 02:02:42,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2021-08-31 02:02:42,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 139 transitions. [2021-08-31 02:02:42,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:42,855 INFO L681 BuchiCegarLoop]: Abstraction has 89 states and 139 transitions. [2021-08-31 02:02:42,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 139 transitions. [2021-08-31 02:02:42,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-08-31 02:02:42,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.5617977528089888) internal successors, (139), 88 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2021-08-31 02:02:42,888 INFO L704 BuchiCegarLoop]: Abstraction has 89 states and 139 transitions. [2021-08-31 02:02:42,888 INFO L587 BuchiCegarLoop]: Abstraction has 89 states and 139 transitions. [2021-08-31 02:02:42,888 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 02:02:42,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 139 transitions. [2021-08-31 02:02:42,895 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2021-08-31 02:02:42,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:42,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:42,896 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:42,896 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:42,896 INFO L791 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 175#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 176#L211 [2021-08-31 02:02:42,896 INFO L793 eck$LassoCheckResult]: Loop: 176#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 222#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 221#L88 assume !(0 != main_~p1~0); 220#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 219#L92-1 assume !(0 != main_~p3~0); 218#L96-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 217#L100-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 207#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 186#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 187#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 205#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 184#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 173#L124-1 assume !(0 != main_~p11~0); 174#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 194#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 212#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 210#L140-1 assume !(0 != main_~p1~0); 211#L146-1 assume 0 != main_~p2~0; 247#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 246#L151 assume !(0 != main_~p3~0); 244#L156-1 assume !(0 != main_~p4~0); 242#L161-1 assume !(0 != main_~p5~0); 240#L166-1 assume !(0 != main_~p6~0); 237#L171-1 assume !(0 != main_~p7~0); 236#L176-1 assume !(0 != main_~p8~0); 234#L181-1 assume !(0 != main_~p9~0); 231#L186-1 assume !(0 != main_~p10~0); 230#L191-1 assume !(0 != main_~p11~0); 228#L196-1 assume !(0 != main_~p12~0); 226#L201-1 assume !(0 != main_~p13~0); 224#L206-1 assume 0 != main_~p14~0; 223#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 176#L211 [2021-08-31 02:02:42,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:42,897 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-31 02:02:42,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:42,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157400563] [2021-08-31 02:02:42,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:42,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:42,919 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:42,939 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:42,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:42,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1215070473, now seen corresponding path program 1 times [2021-08-31 02:02:42,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:42,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075318908] [2021-08-31 02:02:42,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:42,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:42,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:42,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075318908] [2021-08-31 02:02:42,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075318908] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:42,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:42,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:42,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814488434] [2021-08-31 02:02:42,999 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:42,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:42,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:42,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:42,999 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:43,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:43,165 INFO L93 Difference]: Finished difference Result 174 states and 270 transitions. [2021-08-31 02:02:43,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:43,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 270 transitions. [2021-08-31 02:02:43,172 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2021-08-31 02:02:43,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 270 transitions. [2021-08-31 02:02:43,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2021-08-31 02:02:43,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2021-08-31 02:02:43,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 270 transitions. [2021-08-31 02:02:43,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:43,182 INFO L681 BuchiCegarLoop]: Abstraction has 174 states and 270 transitions. [2021-08-31 02:02:43,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 270 transitions. [2021-08-31 02:02:43,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2021-08-31 02:02:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5517241379310345) internal successors, (270), 173 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 270 transitions. [2021-08-31 02:02:43,193 INFO L704 BuchiCegarLoop]: Abstraction has 174 states and 270 transitions. [2021-08-31 02:02:43,193 INFO L587 BuchiCegarLoop]: Abstraction has 174 states and 270 transitions. [2021-08-31 02:02:43,193 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 02:02:43,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 270 transitions. [2021-08-31 02:02:43,194 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2021-08-31 02:02:43,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:43,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:43,194 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:43,194 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:43,194 INFO L791 eck$LassoCheckResult]: Stem: 462#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 444#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 445#L211 [2021-08-31 02:02:43,194 INFO L793 eck$LassoCheckResult]: Loop: 445#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 504#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 502#L88 assume !(0 != main_~p1~0); 499#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 496#L92-1 assume !(0 != main_~p3~0); 492#L96-1 assume !(0 != main_~p4~0); 489#L100-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 488#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 487#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 486#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 475#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 453#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 442#L124-1 assume !(0 != main_~p11~0); 443#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 463#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 482#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 479#L140-1 assume !(0 != main_~p1~0); 481#L146-1 assume 0 != main_~p2~0; 574#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 571#L151 assume !(0 != main_~p3~0); 568#L156-1 assume !(0 != main_~p4~0); 566#L161-1 assume !(0 != main_~p5~0); 562#L166-1 assume !(0 != main_~p6~0); 555#L171-1 assume !(0 != main_~p7~0); 552#L176-1 assume !(0 != main_~p8~0); 535#L181-1 assume !(0 != main_~p9~0); 532#L186-1 assume !(0 != main_~p10~0); 531#L191-1 assume !(0 != main_~p11~0); 529#L196-1 assume !(0 != main_~p12~0); 527#L201-1 assume !(0 != main_~p13~0); 519#L206-1 assume 0 != main_~p14~0; 518#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 445#L211 [2021-08-31 02:02:43,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:43,197 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-31 02:02:43,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:43,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819808441] [2021-08-31 02:02:43,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:43,198 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:43,215 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:43,225 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:43,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:43,226 INFO L82 PathProgramCache]: Analyzing trace with hash 708157561, now seen corresponding path program 1 times [2021-08-31 02:02:43,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:43,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361136312] [2021-08-31 02:02:43,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:43,226 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:43,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:43,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361136312] [2021-08-31 02:02:43,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361136312] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:43,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:43,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:43,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825204114] [2021-08-31 02:02:43,277 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:43,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:43,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:43,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:43,278 INFO L87 Difference]: Start difference. First operand 174 states and 270 transitions. cyclomatic complexity: 100 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:43,406 INFO L93 Difference]: Finished difference Result 342 states and 526 transitions. [2021-08-31 02:02:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:43,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 526 transitions. [2021-08-31 02:02:43,409 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2021-08-31 02:02:43,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 526 transitions. [2021-08-31 02:02:43,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2021-08-31 02:02:43,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2021-08-31 02:02:43,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 526 transitions. [2021-08-31 02:02:43,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:43,412 INFO L681 BuchiCegarLoop]: Abstraction has 342 states and 526 transitions. [2021-08-31 02:02:43,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 526 transitions. [2021-08-31 02:02:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2021-08-31 02:02:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 342 states have (on average 1.5380116959064327) internal successors, (526), 341 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 526 transitions. [2021-08-31 02:02:43,420 INFO L704 BuchiCegarLoop]: Abstraction has 342 states and 526 transitions. [2021-08-31 02:02:43,420 INFO L587 BuchiCegarLoop]: Abstraction has 342 states and 526 transitions. [2021-08-31 02:02:43,420 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 02:02:43,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 526 transitions. [2021-08-31 02:02:43,421 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2021-08-31 02:02:43,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:43,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:43,422 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:43,422 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:43,422 INFO L791 eck$LassoCheckResult]: Stem: 984#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 966#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 967#L211 [2021-08-31 02:02:43,422 INFO L793 eck$LassoCheckResult]: Loop: 967#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 1039#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 1035#L88 assume !(0 != main_~p1~0); 1029#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 1025#L92-1 assume !(0 != main_~p3~0); 1026#L96-1 assume !(0 != main_~p4~0); 1164#L100-1 assume !(0 != main_~p5~0); 1162#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1160#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1158#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1156#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1154#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1152#L124-1 assume !(0 != main_~p11~0); 1150#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1148#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1146#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1143#L140-1 assume !(0 != main_~p1~0); 1140#L146-1 assume 0 != main_~p2~0; 1138#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 1131#L151 assume !(0 != main_~p3~0); 1126#L156-1 assume !(0 != main_~p4~0); 1123#L161-1 assume !(0 != main_~p5~0); 1120#L166-1 assume !(0 != main_~p6~0); 1115#L171-1 assume !(0 != main_~p7~0); 1112#L176-1 assume !(0 != main_~p8~0); 1109#L181-1 assume !(0 != main_~p9~0); 1105#L186-1 assume !(0 != main_~p10~0); 1102#L191-1 assume !(0 != main_~p11~0); 1084#L196-1 assume !(0 != main_~p12~0); 1060#L201-1 assume !(0 != main_~p13~0); 1050#L206-1 assume 0 != main_~p14~0; 1046#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 967#L211 [2021-08-31 02:02:43,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:43,423 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-31 02:02:43,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:43,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562283034] [2021-08-31 02:02:43,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:43,423 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:43,428 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:43,435 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:43,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:43,435 INFO L82 PathProgramCache]: Analyzing trace with hash 770197175, now seen corresponding path program 1 times [2021-08-31 02:02:43,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:43,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392162417] [2021-08-31 02:02:43,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:43,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:43,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:43,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392162417] [2021-08-31 02:02:43,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392162417] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:43,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:43,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:43,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624173267] [2021-08-31 02:02:43,467 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:43,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:43,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:43,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:43,468 INFO L87 Difference]: Start difference. First operand 342 states and 526 transitions. cyclomatic complexity: 192 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:43,588 INFO L93 Difference]: Finished difference Result 674 states and 1026 transitions. [2021-08-31 02:02:43,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:43,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 1026 transitions. [2021-08-31 02:02:43,613 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2021-08-31 02:02:43,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 674 states and 1026 transitions. [2021-08-31 02:02:43,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2021-08-31 02:02:43,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2021-08-31 02:02:43,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 674 states and 1026 transitions. [2021-08-31 02:02:43,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:43,620 INFO L681 BuchiCegarLoop]: Abstraction has 674 states and 1026 transitions. [2021-08-31 02:02:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states and 1026 transitions. [2021-08-31 02:02:43,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2021-08-31 02:02:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 674 states have (on average 1.5222551928783383) internal successors, (1026), 673 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1026 transitions. [2021-08-31 02:02:43,654 INFO L704 BuchiCegarLoop]: Abstraction has 674 states and 1026 transitions. [2021-08-31 02:02:43,654 INFO L587 BuchiCegarLoop]: Abstraction has 674 states and 1026 transitions. [2021-08-31 02:02:43,655 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 02:02:43,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1026 transitions. [2021-08-31 02:02:43,672 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2021-08-31 02:02:43,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:43,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:43,673 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:43,673 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:43,673 INFO L791 eck$LassoCheckResult]: Stem: 2007#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1989#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 1990#L211 [2021-08-31 02:02:43,674 INFO L793 eck$LassoCheckResult]: Loop: 1990#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 2054#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 2055#L88 assume !(0 != main_~p1~0); 2248#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 2255#L92-1 assume !(0 != main_~p3~0); 2254#L96-1 assume !(0 != main_~p4~0); 2251#L100-1 assume !(0 != main_~p5~0); 2177#L104-1 assume !(0 != main_~p6~0); 2179#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2169#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2170#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2161#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2162#L124-1 assume !(0 != main_~p11~0); 2153#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2154#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2145#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2146#L140-1 assume !(0 != main_~p1~0); 2221#L146-1 assume 0 != main_~p2~0; 2218#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 2215#L151 assume !(0 != main_~p3~0); 2214#L156-1 assume !(0 != main_~p4~0); 2295#L161-1 assume !(0 != main_~p5~0); 2294#L166-1 assume !(0 != main_~p6~0); 2292#L171-1 assume !(0 != main_~p7~0); 2291#L176-1 assume !(0 != main_~p8~0); 2281#L181-1 assume !(0 != main_~p9~0); 2241#L186-1 assume !(0 != main_~p10~0); 2242#L191-1 assume !(0 != main_~p11~0); 2183#L196-1 assume !(0 != main_~p12~0); 2182#L201-1 assume !(0 != main_~p13~0); 2072#L206-1 assume 0 != main_~p14~0; 2066#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 1990#L211 [2021-08-31 02:02:43,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:43,674 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-08-31 02:02:43,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:43,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844343326] [2021-08-31 02:02:43,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:43,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:43,681 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:43,705 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:43,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:43,706 INFO L82 PathProgramCache]: Analyzing trace with hash 910745785, now seen corresponding path program 1 times [2021-08-31 02:02:43,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:43,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713466071] [2021-08-31 02:02:43,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:43,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:43,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:43,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713466071] [2021-08-31 02:02:43,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713466071] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:43,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:43,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:43,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465896851] [2021-08-31 02:02:43,737 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:43,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:43,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:43,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:43,738 INFO L87 Difference]: Start difference. First operand 674 states and 1026 transitions. cyclomatic complexity: 368 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:43,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:43,885 INFO L93 Difference]: Finished difference Result 1330 states and 2002 transitions. [2021-08-31 02:02:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:43,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2002 transitions. [2021-08-31 02:02:43,899 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2021-08-31 02:02:43,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 2002 transitions. [2021-08-31 02:02:43,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2021-08-31 02:02:43,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2021-08-31 02:02:43,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 2002 transitions. [2021-08-31 02:02:43,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:43,910 INFO L681 BuchiCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2021-08-31 02:02:43,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 2002 transitions. [2021-08-31 02:02:43,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2021-08-31 02:02:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1330 states have (on average 1.5052631578947369) internal successors, (2002), 1329 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2002 transitions. [2021-08-31 02:02:43,935 INFO L704 BuchiCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2021-08-31 02:02:43,936 INFO L587 BuchiCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2021-08-31 02:02:43,936 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 02:02:43,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 2002 transitions. [2021-08-31 02:02:43,942 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2021-08-31 02:02:43,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:43,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:43,943 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:43,943 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:43,943 INFO L791 eck$LassoCheckResult]: Stem: 4016#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3998#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 3999#L211 [2021-08-31 02:02:43,944 INFO L793 eck$LassoCheckResult]: Loop: 3999#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 4129#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 4125#L88 assume !(0 != main_~p1~0); 4121#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 4117#L92-1 assume !(0 != main_~p3~0); 4110#L96-1 assume !(0 != main_~p4~0); 4102#L100-1 assume !(0 != main_~p5~0); 4094#L104-1 assume !(0 != main_~p6~0); 4088#L108-1 assume !(0 != main_~p7~0); 4084#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4082#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4080#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4078#L124-1 assume !(0 != main_~p11~0); 4075#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4076#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4229#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4068#L140-1 assume !(0 != main_~p1~0); 4062#L146-1 assume 0 != main_~p2~0; 4063#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 4219#L151 assume !(0 != main_~p3~0); 4211#L156-1 assume !(0 != main_~p4~0); 4203#L161-1 assume !(0 != main_~p5~0); 4198#L166-1 assume !(0 != main_~p6~0); 4193#L171-1 assume !(0 != main_~p7~0); 4190#L176-1 assume !(0 != main_~p8~0); 4186#L181-1 assume !(0 != main_~p9~0); 4180#L186-1 assume !(0 != main_~p10~0); 4164#L191-1 assume !(0 != main_~p11~0); 4160#L196-1 assume !(0 != main_~p12~0); 4146#L201-1 assume !(0 != main_~p13~0); 4140#L206-1 assume 0 != main_~p14~0; 4136#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 3999#L211 [2021-08-31 02:02:43,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:43,944 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-08-31 02:02:43,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:43,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057141528] [2021-08-31 02:02:43,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:43,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:43,951 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:43,981 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:43,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:43,982 INFO L82 PathProgramCache]: Analyzing trace with hash 776732279, now seen corresponding path program 1 times [2021-08-31 02:02:43,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:43,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178043695] [2021-08-31 02:02:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:43,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:44,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:44,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178043695] [2021-08-31 02:02:44,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178043695] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:44,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:44,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:44,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560490417] [2021-08-31 02:02:44,003 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:44,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:44,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:44,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:44,005 INFO L87 Difference]: Start difference. First operand 1330 states and 2002 transitions. cyclomatic complexity: 704 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:44,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:44,123 INFO L93 Difference]: Finished difference Result 2626 states and 3906 transitions. [2021-08-31 02:02:44,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:44,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 3906 transitions. [2021-08-31 02:02:44,141 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2021-08-31 02:02:44,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 3906 transitions. [2021-08-31 02:02:44,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2021-08-31 02:02:44,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2021-08-31 02:02:44,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 3906 transitions. [2021-08-31 02:02:44,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:44,158 INFO L681 BuchiCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2021-08-31 02:02:44,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 3906 transitions. [2021-08-31 02:02:44,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2021-08-31 02:02:44,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2626 states have (on average 1.4874333587204875) internal successors, (3906), 2625 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 3906 transitions. [2021-08-31 02:02:44,203 INFO L704 BuchiCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2021-08-31 02:02:44,203 INFO L587 BuchiCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2021-08-31 02:02:44,203 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 02:02:44,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 3906 transitions. [2021-08-31 02:02:44,221 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2021-08-31 02:02:44,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:44,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:44,222 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:44,223 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:44,223 INFO L791 eck$LassoCheckResult]: Stem: 7981#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7962#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 7963#L211 [2021-08-31 02:02:44,223 INFO L793 eck$LassoCheckResult]: Loop: 7963#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 8562#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 8560#L88 assume !(0 != main_~p1~0); 8559#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 8368#L92-1 assume !(0 != main_~p3~0); 8369#L96-1 assume !(0 != main_~p4~0); 8542#L100-1 assume !(0 != main_~p5~0); 8538#L104-1 assume !(0 != main_~p6~0); 8534#L108-1 assume !(0 != main_~p7~0); 8530#L112-1 assume !(0 != main_~p8~0); 8528#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8480#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8481#L124-1 assume !(0 != main_~p11~0); 8472#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8473#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8463#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8464#L140-1 assume !(0 != main_~p1~0); 8526#L146-1 assume 0 != main_~p2~0; 8525#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 8491#L151 assume !(0 != main_~p3~0); 8489#L156-1 assume !(0 != main_~p4~0); 8245#L161-1 assume !(0 != main_~p5~0); 8240#L166-1 assume !(0 != main_~p6~0); 8241#L171-1 assume !(0 != main_~p7~0); 8587#L176-1 assume !(0 != main_~p8~0); 8585#L181-1 assume !(0 != main_~p9~0); 8582#L186-1 assume !(0 != main_~p10~0); 8581#L191-1 assume !(0 != main_~p11~0); 8570#L196-1 assume !(0 != main_~p12~0); 8566#L201-1 assume !(0 != main_~p13~0); 8564#L206-1 assume 0 != main_~p14~0; 8563#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 7963#L211 [2021-08-31 02:02:44,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:44,224 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-08-31 02:02:44,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:44,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280151822] [2021-08-31 02:02:44,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:44,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:44,230 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:44,237 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:44,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:44,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1028706055, now seen corresponding path program 1 times [2021-08-31 02:02:44,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:44,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351283045] [2021-08-31 02:02:44,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:44,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:44,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:44,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351283045] [2021-08-31 02:02:44,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351283045] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:44,253 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:44,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:44,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842028121] [2021-08-31 02:02:44,254 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:44,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:44,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:44,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:44,255 INFO L87 Difference]: Start difference. First operand 2626 states and 3906 transitions. cyclomatic complexity: 1344 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:44,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:44,371 INFO L93 Difference]: Finished difference Result 5186 states and 7618 transitions. [2021-08-31 02:02:44,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:44,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5186 states and 7618 transitions. [2021-08-31 02:02:44,403 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2021-08-31 02:02:44,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5186 states to 5186 states and 7618 transitions. [2021-08-31 02:02:44,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5186 [2021-08-31 02:02:44,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5186 [2021-08-31 02:02:44,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5186 states and 7618 transitions. [2021-08-31 02:02:44,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:44,438 INFO L681 BuchiCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2021-08-31 02:02:44,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states and 7618 transitions. [2021-08-31 02:02:44,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2021-08-31 02:02:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5186 states have (on average 1.4689548785190898) internal successors, (7618), 5185 states have internal predecessors, (7618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:44,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7618 transitions. [2021-08-31 02:02:44,536 INFO L704 BuchiCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2021-08-31 02:02:44,536 INFO L587 BuchiCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2021-08-31 02:02:44,536 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-31 02:02:44,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5186 states and 7618 transitions. [2021-08-31 02:02:44,553 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2021-08-31 02:02:44,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:44,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:44,554 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:44,554 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:44,554 INFO L791 eck$LassoCheckResult]: Stem: 15797#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 15778#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 15779#L211 [2021-08-31 02:02:44,555 INFO L793 eck$LassoCheckResult]: Loop: 15779#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 16492#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 16493#L88 assume !(0 != main_~p1~0); 16478#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 16479#L92-1 assume !(0 != main_~p3~0); 16474#L96-1 assume !(0 != main_~p4~0); 16475#L100-1 assume !(0 != main_~p5~0); 16603#L104-1 assume !(0 != main_~p6~0); 16600#L108-1 assume !(0 != main_~p7~0); 16595#L112-1 assume !(0 != main_~p8~0); 16585#L116-1 assume !(0 != main_~p9~0); 16584#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 16583#L124-1 assume !(0 != main_~p11~0); 16582#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 16316#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 16317#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 16297#L140-1 assume !(0 != main_~p1~0); 16299#L146-1 assume 0 != main_~p2~0; 16208#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 16209#L151 assume !(0 != main_~p3~0); 16198#L156-1 assume !(0 != main_~p4~0); 16199#L161-1 assume !(0 != main_~p5~0); 16188#L166-1 assume !(0 != main_~p6~0); 16189#L171-1 assume !(0 != main_~p7~0); 16575#L176-1 assume !(0 != main_~p8~0); 16627#L181-1 assume !(0 != main_~p9~0); 16625#L186-1 assume !(0 != main_~p10~0); 16624#L191-1 assume !(0 != main_~p11~0); 16622#L196-1 assume !(0 != main_~p12~0); 16521#L201-1 assume !(0 != main_~p13~0); 16520#L206-1 assume 0 != main_~p14~0; 16508#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 15779#L211 [2021-08-31 02:02:44,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:44,555 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-08-31 02:02:44,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:44,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565979880] [2021-08-31 02:02:44,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:44,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:44,569 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:44,574 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:44,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:44,574 INFO L82 PathProgramCache]: Analyzing trace with hash -809851337, now seen corresponding path program 1 times [2021-08-31 02:02:44,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:44,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167708022] [2021-08-31 02:02:44,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:44,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:44,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:44,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167708022] [2021-08-31 02:02:44,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167708022] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:44,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:44,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:44,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593580155] [2021-08-31 02:02:44,635 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:44,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:44,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:44,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:44,637 INFO L87 Difference]: Start difference. First operand 5186 states and 7618 transitions. cyclomatic complexity: 2560 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:44,774 INFO L93 Difference]: Finished difference Result 10242 states and 14850 transitions. [2021-08-31 02:02:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:44,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10242 states and 14850 transitions. [2021-08-31 02:02:44,888 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2021-08-31 02:02:44,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10242 states to 10242 states and 14850 transitions. [2021-08-31 02:02:44,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10242 [2021-08-31 02:02:44,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10242 [2021-08-31 02:02:44,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10242 states and 14850 transitions. [2021-08-31 02:02:44,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:44,956 INFO L681 BuchiCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2021-08-31 02:02:44,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states and 14850 transitions. [2021-08-31 02:02:45,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10242. [2021-08-31 02:02:45,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10242 states, 10242 states have (on average 1.4499121265377857) internal successors, (14850), 10241 states have internal predecessors, (14850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 14850 transitions. [2021-08-31 02:02:45,172 INFO L704 BuchiCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2021-08-31 02:02:45,172 INFO L587 BuchiCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2021-08-31 02:02:45,172 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-31 02:02:45,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10242 states and 14850 transitions. [2021-08-31 02:02:45,213 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2021-08-31 02:02:45,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:45,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:45,214 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:45,214 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:45,215 INFO L791 eck$LassoCheckResult]: Stem: 31232#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 31212#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 31213#L211 [2021-08-31 02:02:45,215 INFO L793 eck$LassoCheckResult]: Loop: 31213#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 31584#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 31585#L88 assume !(0 != main_~p1~0); 31684#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 31683#L92-1 assume !(0 != main_~p3~0); 31681#L96-1 assume !(0 != main_~p4~0); 31679#L100-1 assume !(0 != main_~p5~0); 31677#L104-1 assume !(0 != main_~p6~0); 31675#L108-1 assume !(0 != main_~p7~0); 31671#L112-1 assume !(0 != main_~p8~0); 31667#L116-1 assume !(0 != main_~p9~0); 31664#L120-1 assume !(0 != main_~p10~0); 31662#L124-1 assume !(0 != main_~p11~0); 31660#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 31658#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 31656#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 31654#L140-1 assume !(0 != main_~p1~0); 31652#L146-1 assume 0 != main_~p2~0; 31650#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 31647#L151 assume !(0 != main_~p3~0); 31642#L156-1 assume !(0 != main_~p4~0); 31638#L161-1 assume !(0 != main_~p5~0); 31634#L166-1 assume !(0 != main_~p6~0); 31630#L171-1 assume !(0 != main_~p7~0); 31626#L176-1 assume !(0 != main_~p8~0); 31622#L181-1 assume !(0 != main_~p9~0); 31623#L186-1 assume !(0 != main_~p10~0); 31614#L191-1 assume !(0 != main_~p11~0); 31613#L196-1 assume !(0 != main_~p12~0); 31602#L201-1 assume !(0 != main_~p13~0); 31601#L206-1 assume 0 != main_~p14~0; 31592#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 31213#L211 [2021-08-31 02:02:45,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:45,216 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-08-31 02:02:45,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:45,216 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199581535] [2021-08-31 02:02:45,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:45,216 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:45,222 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:45,228 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:45,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:45,228 INFO L82 PathProgramCache]: Analyzing trace with hash -387149511, now seen corresponding path program 1 times [2021-08-31 02:02:45,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:45,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888631182] [2021-08-31 02:02:45,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:45,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:45,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:45,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888631182] [2021-08-31 02:02:45,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888631182] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:45,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:45,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:45,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908599664] [2021-08-31 02:02:45,257 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:45,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:45,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:45,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:45,258 INFO L87 Difference]: Start difference. First operand 10242 states and 14850 transitions. cyclomatic complexity: 4864 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:45,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:45,480 INFO L93 Difference]: Finished difference Result 20226 states and 28930 transitions. [2021-08-31 02:02:45,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:45,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20226 states and 28930 transitions. [2021-08-31 02:02:45,651 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2021-08-31 02:02:45,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20226 states to 20226 states and 28930 transitions. [2021-08-31 02:02:45,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20226 [2021-08-31 02:02:45,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20226 [2021-08-31 02:02:45,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20226 states and 28930 transitions. [2021-08-31 02:02:45,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:45,824 INFO L681 BuchiCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2021-08-31 02:02:45,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states and 28930 transitions. [2021-08-31 02:02:46,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20226. [2021-08-31 02:02:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20226 states, 20226 states have (on average 1.43033718975576) internal successors, (28930), 20225 states have internal predecessors, (28930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 28930 transitions. [2021-08-31 02:02:46,293 INFO L704 BuchiCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2021-08-31 02:02:46,293 INFO L587 BuchiCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2021-08-31 02:02:46,293 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-31 02:02:46,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20226 states and 28930 transitions. [2021-08-31 02:02:46,535 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2021-08-31 02:02:46,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:46,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:46,536 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:46,536 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:46,536 INFO L791 eck$LassoCheckResult]: Stem: 61707#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 61687#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 61688#L211 [2021-08-31 02:02:46,537 INFO L793 eck$LassoCheckResult]: Loop: 61688#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 61838#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 61836#L88 assume !(0 != main_~p1~0); 61834#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 61832#L92-1 assume !(0 != main_~p3~0); 61828#L96-1 assume !(0 != main_~p4~0); 61824#L100-1 assume !(0 != main_~p5~0); 61820#L104-1 assume !(0 != main_~p6~0); 61816#L108-1 assume !(0 != main_~p7~0); 61812#L112-1 assume !(0 != main_~p8~0); 61808#L116-1 assume !(0 != main_~p9~0); 61804#L120-1 assume !(0 != main_~p10~0); 61802#L124-1 assume !(0 != main_~p11~0); 61798#L128-1 assume !(0 != main_~p12~0); 61796#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 61794#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 61792#L140-1 assume !(0 != main_~p1~0); 61787#L146-1 assume 0 != main_~p2~0; 61784#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 61780#L151 assume !(0 != main_~p3~0); 61779#L156-1 assume !(0 != main_~p4~0); 61877#L161-1 assume !(0 != main_~p5~0); 61873#L166-1 assume !(0 != main_~p6~0); 61869#L171-1 assume !(0 != main_~p7~0); 61865#L176-1 assume !(0 != main_~p8~0); 61861#L181-1 assume !(0 != main_~p9~0); 61857#L186-1 assume !(0 != main_~p10~0); 61854#L191-1 assume !(0 != main_~p11~0); 61849#L196-1 assume !(0 != main_~p12~0); 61846#L201-1 assume !(0 != main_~p13~0); 61843#L206-1 assume 0 != main_~p14~0; 61841#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 61688#L211 [2021-08-31 02:02:46,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:46,537 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-08-31 02:02:46,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:46,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840859613] [2021-08-31 02:02:46,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:46,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:46,555 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:46,568 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:46,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:46,569 INFO L82 PathProgramCache]: Analyzing trace with hash -2076093253, now seen corresponding path program 1 times [2021-08-31 02:02:46,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:46,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467243568] [2021-08-31 02:02:46,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:46,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:46,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:46,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467243568] [2021-08-31 02:02:46,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467243568] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:46,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:46,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:46,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764036102] [2021-08-31 02:02:46,593 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:46,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:46,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:46,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:46,595 INFO L87 Difference]: Start difference. First operand 20226 states and 28930 transitions. cyclomatic complexity: 9216 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:46,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:46,788 INFO L93 Difference]: Finished difference Result 39938 states and 56322 transitions. [2021-08-31 02:02:46,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:46,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39938 states and 56322 transitions. [2021-08-31 02:02:46,981 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2021-08-31 02:02:47,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39938 states to 39938 states and 56322 transitions. [2021-08-31 02:02:47,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39938 [2021-08-31 02:02:47,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39938 [2021-08-31 02:02:47,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39938 states and 56322 transitions. [2021-08-31 02:02:47,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:47,175 INFO L681 BuchiCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2021-08-31 02:02:47,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states and 56322 transitions. [2021-08-31 02:02:47,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 39938. [2021-08-31 02:02:48,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39938 states, 39938 states have (on average 1.4102358655916671) internal successors, (56322), 39937 states have internal predecessors, (56322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39938 states to 39938 states and 56322 transitions. [2021-08-31 02:02:48,236 INFO L704 BuchiCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2021-08-31 02:02:48,236 INFO L587 BuchiCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2021-08-31 02:02:48,236 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-31 02:02:48,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39938 states and 56322 transitions. [2021-08-31 02:02:48,396 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2021-08-31 02:02:48,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:48,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:48,397 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:48,397 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:48,398 INFO L791 eck$LassoCheckResult]: Stem: 121873#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 121856#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 121857#L211 [2021-08-31 02:02:48,398 INFO L793 eck$LassoCheckResult]: Loop: 121857#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 122287#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 122283#L88 assume !(0 != main_~p1~0); 122281#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 122279#L92-1 assume !(0 != main_~p3~0); 122275#L96-1 assume !(0 != main_~p4~0); 122271#L100-1 assume !(0 != main_~p5~0); 122267#L104-1 assume !(0 != main_~p6~0); 122263#L108-1 assume !(0 != main_~p7~0); 122259#L112-1 assume !(0 != main_~p8~0); 122255#L116-1 assume !(0 != main_~p9~0); 122251#L120-1 assume !(0 != main_~p10~0); 122249#L124-1 assume !(0 != main_~p11~0); 122246#L128-1 assume !(0 != main_~p12~0); 122247#L132-1 assume !(0 != main_~p13~0); 122340#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 122337#L140-1 assume !(0 != main_~p1~0); 122335#L146-1 assume 0 != main_~p2~0; 122332#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 122329#L151 assume !(0 != main_~p3~0); 122324#L156-1 assume !(0 != main_~p4~0); 122320#L161-1 assume !(0 != main_~p5~0); 122316#L166-1 assume !(0 != main_~p6~0); 122312#L171-1 assume !(0 != main_~p7~0); 122308#L176-1 assume !(0 != main_~p8~0); 122304#L181-1 assume !(0 != main_~p9~0); 122300#L186-1 assume !(0 != main_~p10~0); 122298#L191-1 assume !(0 != main_~p11~0); 122296#L196-1 assume !(0 != main_~p12~0); 122294#L201-1 assume !(0 != main_~p13~0); 122292#L206-1 assume 0 != main_~p14~0; 122290#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 121857#L211 [2021-08-31 02:02:48,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:48,399 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-08-31 02:02:48,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:48,399 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283849369] [2021-08-31 02:02:48,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:48,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:48,404 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:48,410 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:48,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:48,411 INFO L82 PathProgramCache]: Analyzing trace with hash 224729337, now seen corresponding path program 1 times [2021-08-31 02:02:48,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:48,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39615819] [2021-08-31 02:02:48,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:48,412 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:48,415 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:48,425 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:48,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:48,426 INFO L82 PathProgramCache]: Analyzing trace with hash -233466693, now seen corresponding path program 1 times [2021-08-31 02:02:48,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:48,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334299744] [2021-08-31 02:02:48,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:48,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:48,432 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:48,442 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:49,153 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 02:02:49,157 INFO L158 Benchmark]: Toolchain (without parser) took 7647.01ms. Allocated memory was 56.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 35.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 345.4MB. Max. memory is 16.1GB. [2021-08-31 02:02:49,157 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 56.6MB. Free memory is still 39.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 02:02:49,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.80ms. Allocated memory is still 56.6MB. Free memory was 35.7MB in the beginning and 40.1MB in the end (delta: -4.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-31 02:02:49,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.13ms. Allocated memory is still 56.6MB. Free memory was 40.1MB in the beginning and 38.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 02:02:49,158 INFO L158 Benchmark]: Boogie Preprocessor took 43.86ms. Allocated memory is still 56.6MB. Free memory was 38.4MB in the beginning and 36.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 02:02:49,158 INFO L158 Benchmark]: RCFGBuilder took 233.24ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 36.9MB in the beginning and 51.9MB in the end (delta: -15.0MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2021-08-31 02:02:49,158 INFO L158 Benchmark]: BuchiAutomizer took 7056.85ms. Allocated memory was 69.2MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 51.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 348.9MB. Max. memory is 16.1GB. [2021-08-31 02:02:49,160 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.61ms. Allocated memory is still 56.6MB. Free memory is still 39.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.80ms. Allocated memory is still 56.6MB. Free memory was 35.7MB in the beginning and 40.1MB in the end (delta: -4.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.13ms. Allocated memory is still 56.6MB. Free memory was 40.1MB in the beginning and 38.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.86ms. Allocated memory is still 56.6MB. Free memory was 38.4MB in the beginning and 36.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 233.24ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 36.9MB in the beginning and 51.9MB in the end (delta: -15.0MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 7056.85ms. Allocated memory was 69.2MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 51.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 348.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 39938 locations. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 02:02:49,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...