./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_9.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_9.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 20a70402cc893fb2c7adec21ca8a267adc3c5cbb .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:03:03,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 02:03:03,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 02:03:03,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 02:03:03,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 02:03:03,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 02:03:03,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 02:03:03,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 02:03:03,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 02:03:03,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 02:03:03,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 02:03:03,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 02:03:03,225 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 02:03:03,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 02:03:03,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 02:03:03,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 02:03:03,234 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 02:03:03,235 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 02:03:03,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 02:03:03,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 02:03:03,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 02:03:03,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 02:03:03,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 02:03:03,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 02:03:03,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 02:03:03,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 02:03:03,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 02:03:03,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 02:03:03,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 02:03:03,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 02:03:03,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 02:03:03,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 02:03:03,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 02:03:03,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 02:03:03,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 02:03:03,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 02:03:03,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 02:03:03,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 02:03:03,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 02:03:03,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 02:03:03,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 02:03:03,298 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:03:03,352 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 02:03:03,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 02:03:03,353 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 02:03:03,354 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 02:03:03,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 02:03:03,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 02:03:03,356 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 02:03:03,356 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 02:03:03,356 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 02:03:03,356 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 02:03:03,357 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 02:03:03,357 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 02:03:03,357 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 02:03:03,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 02:03:03,358 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 02:03:03,358 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 02:03:03,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 02:03:03,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 02:03:03,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 02:03:03,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 02:03:03,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 02:03:03,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 02:03:03,362 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 02:03:03,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 02:03:03,362 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 02:03:03,362 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 02:03:03,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 02:03:03,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 02:03:03,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 02:03:03,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 02:03:03,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 02:03:03,363 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 02:03:03,365 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 02:03:03,380 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 -> 20a70402cc893fb2c7adec21ca8a267adc3c5cbb [2021-08-31 02:03:03,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 02:03:04,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 02:03:04,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 02:03:04,036 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 02:03:04,037 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 02:03:04,038 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2021-08-31 02:03:04,150 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9fca8dd/e0b5330b400f4b018c321b69101d282d/FLAG3a8501a40 [2021-08-31 02:03:04,948 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 02:03:04,949 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2021-08-31 02:03:04,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9fca8dd/e0b5330b400f4b018c321b69101d282d/FLAG3a8501a40 [2021-08-31 02:03:04,994 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9fca8dd/e0b5330b400f4b018c321b69101d282d [2021-08-31 02:03:04,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 02:03:04,999 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 02:03:05,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 02:03:05,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 02:03:05,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 02:03:05,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:03:04" (1/1) ... [2021-08-31 02:03:05,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11abaf17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:03:05, skipping insertion in model container [2021-08-31 02:03:05,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:03:04" (1/1) ... [2021-08-31 02:03:05,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 02:03:05,066 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 02:03:05,346 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_9.c[3555,3568] [2021-08-31 02:03:05,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 02:03:05,386 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 02:03:05,482 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_9.c[3555,3568] [2021-08-31 02:03:05,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 02:03:05,519 INFO L208 MainTranslator]: Completed translation [2021-08-31 02:03:05,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:03:05 WrapperNode [2021-08-31 02:03:05,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 02:03:05,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 02:03:05,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 02:03:05,522 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 02:03:05,528 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:03:05" (1/1) ... [2021-08-31 02:03:05,547 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:03:05" (1/1) ... [2021-08-31 02:03:05,585 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 02:03:05,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 02:03:05,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 02:03:05,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 02:03:05,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:03:05" (1/1) ... [2021-08-31 02:03:05,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:03:05" (1/1) ... [2021-08-31 02:03:05,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:03:05" (1/1) ... [2021-08-31 02:03:05,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:03:05" (1/1) ... [2021-08-31 02:03:05,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:03:05" (1/1) ... [2021-08-31 02:03:05,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:03:05" (1/1) ... [2021-08-31 02:03:05,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:03:05" (1/1) ... [2021-08-31 02:03:05,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 02:03:05,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 02:03:05,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 02:03:05,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 02:03:05,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:03:05" (1/1) ... [2021-08-31 02:03:05,670 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:03:05,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:03:05,738 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:03:05,744 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:03:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 02:03:05,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 02:03:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 02:03:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 02:03:05,923 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 02:03:05,924 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-31 02:03:05,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:03:05 BoogieIcfgContainer [2021-08-31 02:03:05,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 02:03:05,926 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 02:03:05,927 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 02:03:05,929 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 02:03:05,930 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:03:05,930 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 02:03:04" (1/3) ... [2021-08-31 02:03:05,931 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52cf2639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 02:03:05, skipping insertion in model container [2021-08-31 02:03:05,931 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:03:05,931 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:03:05" (2/3) ... [2021-08-31 02:03:05,932 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52cf2639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 02:03:05, skipping insertion in model container [2021-08-31 02:03:05,932 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:03:05,932 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:03:05" (3/3) ... [2021-08-31 02:03:05,933 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_9.c [2021-08-31 02:03:05,971 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 02:03:05,971 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 02:03:05,971 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 02:03:05,972 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 02:03:05,972 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 02:03:05,972 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 02:03:05,972 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 02:03:05,972 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 02:03:05,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 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:03:06,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2021-08-31 02:03:06,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:03:06,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:03:06,005 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:03:06,006 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] [2021-08-31 02:03:06,006 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 02:03:06,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 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:03:06,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2021-08-31 02:03:06,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:03:06,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:03:06,010 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:03:06,010 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] [2021-08-31 02:03:06,018 INFO L791 eck$LassoCheckResult]: Stem: 19#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 8#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_~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_~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;havoc main_~cond~0; 14#L141-1true [2021-08-31 02:03:06,018 INFO L793 eck$LassoCheckResult]: Loop: 14#L141-1true assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 36#L40true 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; 4#L63true assume 0 != main_~p1~0;main_~lk1~0 := 1; 21#L63-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 28#L67-1true assume !(0 != main_~p3~0); 25#L71-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 29#L75-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 15#L79-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 37#L83-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 10#L87-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 5#L91-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 34#L95-1true assume !(0 != main_~p1~0); 23#L101-1true assume !(0 != main_~p2~0); 11#L106-1true assume !(0 != main_~p3~0); 12#L111-1true assume !(0 != main_~p4~0); 33#L116-1true assume !(0 != main_~p5~0); 6#L121-1true assume !(0 != main_~p6~0); 18#L126-1true assume !(0 != main_~p7~0); 30#L131-1true assume !(0 != main_~p8~0); 20#L136-1true assume !(0 != main_~p9~0); 14#L141-1true [2021-08-31 02:03:06,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:06,023 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-31 02:03:06,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:06,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118416559] [2021-08-31 02:03:06,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:06,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:06,107 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:03:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:06,163 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:03:06,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:06,165 INFO L82 PathProgramCache]: Analyzing trace with hash 694706197, now seen corresponding path program 1 times [2021-08-31 02:03:06,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:06,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420846305] [2021-08-31 02:03:06,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:06,167 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:03:06,295 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:03:06,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:03:06,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420846305] [2021-08-31 02:03:06,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420846305] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:03:06,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:03:06,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:03:06,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89316032] [2021-08-31 02:03:06,300 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:03:06,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:03:06,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:03:06,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:03:06,334 INFO L87 Difference]: Start difference. First operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 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 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:03:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:03:06,592 INFO L93 Difference]: Finished difference Result 69 states and 118 transitions. [2021-08-31 02:03:06,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:03:06,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 118 transitions. [2021-08-31 02:03:06,601 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2021-08-31 02:03:06,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 59 states and 93 transitions. [2021-08-31 02:03:06,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2021-08-31 02:03:06,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2021-08-31 02:03:06,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 93 transitions. [2021-08-31 02:03:06,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:03:06,607 INFO L681 BuchiCegarLoop]: Abstraction has 59 states and 93 transitions. [2021-08-31 02:03:06,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 93 transitions. [2021-08-31 02:03:06,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-08-31 02:03:06,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.576271186440678) internal successors, (93), 58 states have internal predecessors, (93), 0 states have call successors, (0), 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:03:06,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 93 transitions. [2021-08-31 02:03:06,633 INFO L704 BuchiCegarLoop]: Abstraction has 59 states and 93 transitions. [2021-08-31 02:03:06,634 INFO L587 BuchiCegarLoop]: Abstraction has 59 states and 93 transitions. [2021-08-31 02:03:06,634 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 02:03:06,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 93 transitions. [2021-08-31 02:03:06,635 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2021-08-31 02:03:06,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:03:06,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:03:06,636 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:03:06,644 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] [2021-08-31 02:03:06,645 INFO L791 eck$LassoCheckResult]: Stem: 138#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 123#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_~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_~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;havoc main_~cond~0; 124#L141-1 [2021-08-31 02:03:06,645 INFO L793 eck$LassoCheckResult]: Loop: 124#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 131#L40 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; 158#L63 assume !(0 != main_~p1~0); 157#L63-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 146#L67-1 assume !(0 != main_~p3~0); 147#L71-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 148#L75-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 132#L79-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 133#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 125#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 116#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 117#L95-1 assume !(0 != main_~p1~0); 142#L101-1 assume !(0 != main_~p2~0); 126#L106-1 assume !(0 != main_~p3~0); 127#L111-1 assume !(0 != main_~p4~0); 122#L116-1 assume !(0 != main_~p5~0); 118#L121-1 assume !(0 != main_~p6~0); 120#L126-1 assume !(0 != main_~p7~0); 162#L131-1 assume !(0 != main_~p8~0); 139#L136-1 assume !(0 != main_~p9~0); 124#L141-1 [2021-08-31 02:03:06,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:06,646 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-31 02:03:06,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:06,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604041190] [2021-08-31 02:03:06,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:06,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:06,676 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:03:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:06,690 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:03:06,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:06,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1299438509, now seen corresponding path program 1 times [2021-08-31 02:03:06,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:06,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777522440] [2021-08-31 02:03:06,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:06,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:03:06,717 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:03:06,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:03:06,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777522440] [2021-08-31 02:03:06,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777522440] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:03:06,718 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:03:06,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:03:06,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893810289] [2021-08-31 02:03:06,719 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:03:06,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:03:06,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:03:06,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:03:06,720 INFO L87 Difference]: Start difference. First operand 59 states and 93 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:03:06,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:03:06,817 INFO L93 Difference]: Finished difference Result 114 states and 178 transitions. [2021-08-31 02:03:06,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:03:06,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 178 transitions. [2021-08-31 02:03:06,821 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2021-08-31 02:03:06,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 178 transitions. [2021-08-31 02:03:06,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2021-08-31 02:03:06,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2021-08-31 02:03:06,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 178 transitions. [2021-08-31 02:03:06,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:03:06,824 INFO L681 BuchiCegarLoop]: Abstraction has 114 states and 178 transitions. [2021-08-31 02:03:06,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 178 transitions. [2021-08-31 02:03:06,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-08-31 02:03:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 1.5614035087719298) internal successors, (178), 113 states have internal predecessors, (178), 0 states have call successors, (0), 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:03:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 178 transitions. [2021-08-31 02:03:06,835 INFO L704 BuchiCegarLoop]: Abstraction has 114 states and 178 transitions. [2021-08-31 02:03:06,835 INFO L587 BuchiCegarLoop]: Abstraction has 114 states and 178 transitions. [2021-08-31 02:03:06,836 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 02:03:06,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 178 transitions. [2021-08-31 02:03:06,837 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2021-08-31 02:03:06,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:03:06,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:03:06,840 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:03:06,840 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] [2021-08-31 02:03:06,840 INFO L791 eck$LassoCheckResult]: Stem: 321#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 302#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_~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_~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;havoc main_~cond~0; 303#L141-1 [2021-08-31 02:03:06,841 INFO L793 eck$LassoCheckResult]: Loop: 303#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 339#L40 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; 336#L63 assume !(0 != main_~p1~0); 337#L63-2 assume !(0 != main_~p2~0); 379#L67-1 assume !(0 != main_~p3~0); 378#L71-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 377#L75-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 376#L79-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 375#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 374#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 373#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 372#L95-1 assume !(0 != main_~p1~0); 371#L101-1 assume !(0 != main_~p2~0); 368#L106-1 assume !(0 != main_~p3~0); 363#L111-1 assume !(0 != main_~p4~0); 360#L116-1 assume !(0 != main_~p5~0); 356#L121-1 assume !(0 != main_~p6~0); 352#L126-1 assume !(0 != main_~p7~0); 348#L131-1 assume !(0 != main_~p8~0); 344#L136-1 assume !(0 != main_~p9~0); 303#L141-1 [2021-08-31 02:03:06,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:06,841 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-31 02:03:06,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:06,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96750999] [2021-08-31 02:03:06,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:06,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:06,851 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:03:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:06,861 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:03:06,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:06,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1407180885, now seen corresponding path program 1 times [2021-08-31 02:03:06,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:06,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346743121] [2021-08-31 02:03:06,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:06,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:03:06,883 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:03:06,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:03:06,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346743121] [2021-08-31 02:03:06,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346743121] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:03:06,884 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:03:06,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:03:06,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778762175] [2021-08-31 02:03:06,884 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:03:06,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:03:06,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:03:06,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:03:06,885 INFO L87 Difference]: Start difference. First operand 114 states and 178 transitions. cyclomatic complexity: 68 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:03:06,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:03:06,988 INFO L93 Difference]: Finished difference Result 222 states and 342 transitions. [2021-08-31 02:03:06,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:03:06,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 342 transitions. [2021-08-31 02:03:06,991 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2021-08-31 02:03:06,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 222 states and 342 transitions. [2021-08-31 02:03:06,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2021-08-31 02:03:06,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2021-08-31 02:03:06,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 342 transitions. [2021-08-31 02:03:06,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:03:06,996 INFO L681 BuchiCegarLoop]: Abstraction has 222 states and 342 transitions. [2021-08-31 02:03:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 342 transitions. [2021-08-31 02:03:07,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2021-08-31 02:03:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 222 states have (on average 1.5405405405405406) internal successors, (342), 221 states have internal predecessors, (342), 0 states have call successors, (0), 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:03:07,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2021-08-31 02:03:07,009 INFO L704 BuchiCegarLoop]: Abstraction has 222 states and 342 transitions. [2021-08-31 02:03:07,009 INFO L587 BuchiCegarLoop]: Abstraction has 222 states and 342 transitions. [2021-08-31 02:03:07,009 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 02:03:07,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 222 states and 342 transitions. [2021-08-31 02:03:07,011 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2021-08-31 02:03:07,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:03:07,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:03:07,012 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:03:07,012 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] [2021-08-31 02:03:07,012 INFO L791 eck$LassoCheckResult]: Stem: 662#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 644#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_~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_~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;havoc main_~cond~0; 645#L141-1 [2021-08-31 02:03:07,012 INFO L793 eck$LassoCheckResult]: Loop: 645#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 709#L40 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; 706#L63 assume !(0 != main_~p1~0); 703#L63-2 assume !(0 != main_~p2~0); 701#L67-1 assume !(0 != main_~p3~0); 698#L71-1 assume !(0 != main_~p4~0); 696#L75-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 694#L79-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 692#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 690#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 688#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 685#L95-1 assume !(0 != main_~p1~0); 686#L101-1 assume !(0 != main_~p2~0); 734#L106-1 assume !(0 != main_~p3~0); 729#L111-1 assume !(0 != main_~p4~0); 728#L116-1 assume !(0 != main_~p5~0); 724#L121-1 assume !(0 != main_~p6~0); 720#L126-1 assume !(0 != main_~p7~0); 716#L131-1 assume !(0 != main_~p8~0); 713#L136-1 assume !(0 != main_~p9~0); 645#L141-1 [2021-08-31 02:03:07,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:07,013 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-31 02:03:07,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:07,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512121215] [2021-08-31 02:03:07,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:07,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:07,023 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:03:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:07,041 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:03:07,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:07,042 INFO L82 PathProgramCache]: Analyzing trace with hash 127317207, now seen corresponding path program 1 times [2021-08-31 02:03:07,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:07,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100430633] [2021-08-31 02:03:07,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:07,043 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:03:07,083 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:03:07,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:03:07,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100430633] [2021-08-31 02:03:07,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100430633] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:03:07,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:03:07,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:03:07,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328378701] [2021-08-31 02:03:07,084 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:03:07,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:03:07,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:03:07,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:03:07,085 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. cyclomatic complexity: 128 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:03:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:03:07,197 INFO L93 Difference]: Finished difference Result 434 states and 658 transitions. [2021-08-31 02:03:07,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:03:07,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 434 states and 658 transitions. [2021-08-31 02:03:07,202 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2021-08-31 02:03:07,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 434 states to 434 states and 658 transitions. [2021-08-31 02:03:07,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 434 [2021-08-31 02:03:07,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 434 [2021-08-31 02:03:07,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 434 states and 658 transitions. [2021-08-31 02:03:07,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:03:07,218 INFO L681 BuchiCegarLoop]: Abstraction has 434 states and 658 transitions. [2021-08-31 02:03:07,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states and 658 transitions. [2021-08-31 02:03:07,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2021-08-31 02:03:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 434 states have (on average 1.5161290322580645) internal successors, (658), 433 states have internal predecessors, (658), 0 states have call successors, (0), 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:03:07,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 658 transitions. [2021-08-31 02:03:07,255 INFO L704 BuchiCegarLoop]: Abstraction has 434 states and 658 transitions. [2021-08-31 02:03:07,256 INFO L587 BuchiCegarLoop]: Abstraction has 434 states and 658 transitions. [2021-08-31 02:03:07,256 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 02:03:07,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 434 states and 658 transitions. [2021-08-31 02:03:07,263 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2021-08-31 02:03:07,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:03:07,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:03:07,264 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:03:07,265 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] [2021-08-31 02:03:07,265 INFO L791 eck$LassoCheckResult]: Stem: 1324#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1306#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_~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_~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;havoc main_~cond~0; 1307#L141-1 [2021-08-31 02:03:07,265 INFO L793 eck$LassoCheckResult]: Loop: 1307#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 1355#L40 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; 1356#L63 assume !(0 != main_~p1~0); 1456#L63-2 assume !(0 != main_~p2~0); 1455#L67-1 assume !(0 != main_~p3~0); 1449#L71-1 assume !(0 != main_~p4~0); 1443#L75-1 assume !(0 != main_~p5~0); 1439#L79-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1435#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1431#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1427#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1404#L95-1 assume !(0 != main_~p1~0); 1405#L101-1 assume !(0 != main_~p2~0); 1418#L106-1 assume !(0 != main_~p3~0); 1414#L111-1 assume !(0 != main_~p4~0); 1411#L116-1 assume !(0 != main_~p5~0); 1412#L121-1 assume !(0 != main_~p6~0); 1469#L126-1 assume !(0 != main_~p7~0); 1379#L131-1 assume !(0 != main_~p8~0); 1378#L136-1 assume !(0 != main_~p9~0); 1307#L141-1 [2021-08-31 02:03:07,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:07,266 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-08-31 02:03:07,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:07,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943499651] [2021-08-31 02:03:07,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:07,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:07,288 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:03:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:07,300 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:03:07,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:07,303 INFO L82 PathProgramCache]: Analyzing trace with hash -883800043, now seen corresponding path program 1 times [2021-08-31 02:03:07,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:07,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519260384] [2021-08-31 02:03:07,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:07,304 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:03:07,334 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:03:07,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:03:07,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519260384] [2021-08-31 02:03:07,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519260384] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:03:07,335 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:03:07,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:03:07,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866985070] [2021-08-31 02:03:07,335 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:03:07,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:03:07,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:03:07,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:03:07,336 INFO L87 Difference]: Start difference. First operand 434 states and 658 transitions. cyclomatic complexity: 240 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:03:07,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:03:07,442 INFO L93 Difference]: Finished difference Result 850 states and 1266 transitions. [2021-08-31 02:03:07,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:03:07,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 850 states and 1266 transitions. [2021-08-31 02:03:07,452 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2021-08-31 02:03:07,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 850 states to 850 states and 1266 transitions. [2021-08-31 02:03:07,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 850 [2021-08-31 02:03:07,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 850 [2021-08-31 02:03:07,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 850 states and 1266 transitions. [2021-08-31 02:03:07,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:03:07,462 INFO L681 BuchiCegarLoop]: Abstraction has 850 states and 1266 transitions. [2021-08-31 02:03:07,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states and 1266 transitions. [2021-08-31 02:03:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2021-08-31 02:03:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 850 states have (on average 1.4894117647058824) internal successors, (1266), 849 states have internal predecessors, (1266), 0 states have call successors, (0), 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:03:07,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1266 transitions. [2021-08-31 02:03:07,516 INFO L704 BuchiCegarLoop]: Abstraction has 850 states and 1266 transitions. [2021-08-31 02:03:07,516 INFO L587 BuchiCegarLoop]: Abstraction has 850 states and 1266 transitions. [2021-08-31 02:03:07,516 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 02:03:07,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 850 states and 1266 transitions. [2021-08-31 02:03:07,522 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2021-08-31 02:03:07,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:03:07,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:03:07,537 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:03:07,537 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] [2021-08-31 02:03:07,538 INFO L791 eck$LassoCheckResult]: Stem: 2614#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2595#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_~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_~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;havoc main_~cond~0; 2596#L141-1 [2021-08-31 02:03:07,538 INFO L793 eck$LassoCheckResult]: Loop: 2596#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 2768#L40 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; 2766#L63 assume !(0 != main_~p1~0); 2762#L63-2 assume !(0 != main_~p2~0); 2763#L67-1 assume !(0 != main_~p3~0); 2746#L71-1 assume !(0 != main_~p4~0); 2748#L75-1 assume !(0 != main_~p5~0); 2735#L79-1 assume !(0 != main_~p6~0); 2736#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2723#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2724#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2706#L95-1 assume !(0 != main_~p1~0); 2707#L101-1 assume !(0 != main_~p2~0); 2789#L106-1 assume !(0 != main_~p3~0); 2786#L111-1 assume !(0 != main_~p4~0); 2784#L116-1 assume !(0 != main_~p5~0); 2782#L121-1 assume !(0 != main_~p6~0); 2781#L126-1 assume !(0 != main_~p7~0); 2777#L131-1 assume !(0 != main_~p8~0); 2773#L136-1 assume !(0 != main_~p9~0); 2596#L141-1 [2021-08-31 02:03:07,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:07,539 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-08-31 02:03:07,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:07,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426015290] [2021-08-31 02:03:07,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:07,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:07,560 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:03:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:07,570 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:03:07,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:07,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1470606057, now seen corresponding path program 1 times [2021-08-31 02:03:07,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:07,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452460721] [2021-08-31 02:03:07,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:07,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:03:07,598 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:03:07,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:03:07,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452460721] [2021-08-31 02:03:07,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452460721] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:03:07,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:03:07,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:03:07,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545748745] [2021-08-31 02:03:07,600 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:03:07,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:03:07,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:03:07,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:03:07,601 INFO L87 Difference]: Start difference. First operand 850 states and 1266 transitions. cyclomatic complexity: 448 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:03:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:03:07,689 INFO L93 Difference]: Finished difference Result 1666 states and 2434 transitions. [2021-08-31 02:03:07,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:03:07,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1666 states and 2434 transitions. [2021-08-31 02:03:07,712 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2021-08-31 02:03:07,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1666 states to 1666 states and 2434 transitions. [2021-08-31 02:03:07,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1666 [2021-08-31 02:03:07,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1666 [2021-08-31 02:03:07,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1666 states and 2434 transitions. [2021-08-31 02:03:07,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:03:07,727 INFO L681 BuchiCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2021-08-31 02:03:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states and 2434 transitions. [2021-08-31 02:03:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2021-08-31 02:03:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1666 states have (on average 1.460984393757503) internal successors, (2434), 1665 states have internal predecessors, (2434), 0 states have call successors, (0), 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:03:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2434 transitions. [2021-08-31 02:03:07,759 INFO L704 BuchiCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2021-08-31 02:03:07,759 INFO L587 BuchiCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2021-08-31 02:03:07,759 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 02:03:07,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1666 states and 2434 transitions. [2021-08-31 02:03:07,773 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2021-08-31 02:03:07,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:03:07,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:03:07,774 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:03:07,774 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] [2021-08-31 02:03:07,775 INFO L791 eck$LassoCheckResult]: Stem: 5137#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 5117#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_~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_~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;havoc main_~cond~0; 5118#L141-1 [2021-08-31 02:03:07,775 INFO L793 eck$LassoCheckResult]: Loop: 5118#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 5213#L40 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; 5210#L63 assume !(0 != main_~p1~0); 5207#L63-2 assume !(0 != main_~p2~0); 5204#L67-1 assume !(0 != main_~p3~0); 5200#L71-1 assume !(0 != main_~p4~0); 5196#L75-1 assume !(0 != main_~p5~0); 5192#L79-1 assume !(0 != main_~p6~0); 5189#L83-1 assume !(0 != main_~p7~0); 5187#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 5185#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 5182#L95-1 assume !(0 != main_~p1~0); 5183#L101-1 assume !(0 != main_~p2~0); 5240#L106-1 assume !(0 != main_~p3~0); 5235#L111-1 assume !(0 != main_~p4~0); 5231#L116-1 assume !(0 != main_~p5~0); 5227#L121-1 assume !(0 != main_~p6~0); 5223#L126-1 assume !(0 != main_~p7~0); 5220#L131-1 assume !(0 != main_~p8~0); 5217#L136-1 assume !(0 != main_~p9~0); 5118#L141-1 [2021-08-31 02:03:07,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:07,778 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-08-31 02:03:07,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:07,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324585233] [2021-08-31 02:03:07,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:07,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:07,786 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:03:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:07,793 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:03:07,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:07,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1212440619, now seen corresponding path program 1 times [2021-08-31 02:03:07,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:07,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887028109] [2021-08-31 02:03:07,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:07,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:03:07,835 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:03:07,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:03:07,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887028109] [2021-08-31 02:03:07,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887028109] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:03:07,836 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:03:07,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:03:07,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609550720] [2021-08-31 02:03:07,837 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:03:07,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:03:07,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:03:07,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:03:07,838 INFO L87 Difference]: Start difference. First operand 1666 states and 2434 transitions. cyclomatic complexity: 832 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:03:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:03:07,938 INFO L93 Difference]: Finished difference Result 3266 states and 4674 transitions. [2021-08-31 02:03:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:03:07,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3266 states and 4674 transitions. [2021-08-31 02:03:07,965 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2021-08-31 02:03:08,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3266 states to 3266 states and 4674 transitions. [2021-08-31 02:03:08,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3266 [2021-08-31 02:03:08,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3266 [2021-08-31 02:03:08,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3266 states and 4674 transitions. [2021-08-31 02:03:08,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:03:08,010 INFO L681 BuchiCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2021-08-31 02:03:08,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states and 4674 transitions. [2021-08-31 02:03:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2021-08-31 02:03:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3266 states have (on average 1.4311083894672383) internal successors, (4674), 3265 states have internal predecessors, (4674), 0 states have call successors, (0), 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:03:08,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4674 transitions. [2021-08-31 02:03:08,080 INFO L704 BuchiCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2021-08-31 02:03:08,080 INFO L587 BuchiCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2021-08-31 02:03:08,081 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-31 02:03:08,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3266 states and 4674 transitions. [2021-08-31 02:03:08,112 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2021-08-31 02:03:08,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:03:08,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:03:08,112 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:03:08,113 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] [2021-08-31 02:03:08,113 INFO L791 eck$LassoCheckResult]: Stem: 10073#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 10055#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_~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_~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;havoc main_~cond~0; 10056#L141-1 [2021-08-31 02:03:08,113 INFO L793 eck$LassoCheckResult]: Loop: 10056#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 10243#L40 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; 10240#L63 assume !(0 != main_~p1~0); 10241#L63-2 assume !(0 != main_~p2~0); 10224#L67-1 assume !(0 != main_~p3~0); 10225#L71-1 assume !(0 != main_~p4~0); 10208#L75-1 assume !(0 != main_~p5~0); 10210#L79-1 assume !(0 != main_~p6~0); 10184#L83-1 assume !(0 != main_~p7~0); 10186#L87-1 assume !(0 != main_~p8~0); 10164#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 10165#L95-1 assume !(0 != main_~p1~0); 10268#L101-1 assume !(0 != main_~p2~0); 10267#L106-1 assume !(0 != main_~p3~0); 10264#L111-1 assume !(0 != main_~p4~0); 10262#L116-1 assume !(0 != main_~p5~0); 10258#L121-1 assume !(0 != main_~p6~0); 10254#L126-1 assume !(0 != main_~p7~0); 10250#L131-1 assume !(0 != main_~p8~0); 10247#L136-1 assume !(0 != main_~p9~0); 10056#L141-1 [2021-08-31 02:03:08,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:08,113 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-08-31 02:03:08,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:08,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433292034] [2021-08-31 02:03:08,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:08,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:08,125 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:03:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:08,141 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:03:08,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:08,142 INFO L82 PathProgramCache]: Analyzing trace with hash -511376041, now seen corresponding path program 1 times [2021-08-31 02:03:08,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:08,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280538229] [2021-08-31 02:03:08,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:08,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:03:08,179 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:03:08,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:03:08,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280538229] [2021-08-31 02:03:08,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280538229] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:03:08,180 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:03:08,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-31 02:03:08,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781886224] [2021-08-31 02:03:08,181 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:03:08,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:03:08,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:03:08,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:03:08,182 INFO L87 Difference]: Start difference. First operand 3266 states and 4674 transitions. cyclomatic complexity: 1536 Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:03:08,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:03:08,286 INFO L93 Difference]: Finished difference Result 6402 states and 8962 transitions. [2021-08-31 02:03:08,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:03:08,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6402 states and 8962 transitions. [2021-08-31 02:03:08,364 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2021-08-31 02:03:08,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6402 states to 6402 states and 8962 transitions. [2021-08-31 02:03:08,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6402 [2021-08-31 02:03:08,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6402 [2021-08-31 02:03:08,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6402 states and 8962 transitions. [2021-08-31 02:03:08,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:03:08,447 INFO L681 BuchiCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2021-08-31 02:03:08,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6402 states and 8962 transitions. [2021-08-31 02:03:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6402 to 6402. [2021-08-31 02:03:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6402 states, 6402 states have (on average 1.3998750390502968) internal successors, (8962), 6401 states have internal predecessors, (8962), 0 states have call successors, (0), 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:03:08,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6402 states to 6402 states and 8962 transitions. [2021-08-31 02:03:08,677 INFO L704 BuchiCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2021-08-31 02:03:08,677 INFO L587 BuchiCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2021-08-31 02:03:08,677 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-31 02:03:08,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6402 states and 8962 transitions. [2021-08-31 02:03:08,731 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2021-08-31 02:03:08,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:03:08,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:03:08,732 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:03:08,732 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] [2021-08-31 02:03:08,733 INFO L791 eck$LassoCheckResult]: Stem: 19746#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 19729#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_~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_~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;havoc main_~cond~0; 19730#L141-1 [2021-08-31 02:03:08,733 INFO L793 eck$LassoCheckResult]: Loop: 19730#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 20273#L40 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; 20270#L63 assume !(0 != main_~p1~0); 20271#L63-2 assume !(0 != main_~p2~0); 20256#L67-1 assume !(0 != main_~p3~0); 20253#L71-1 assume !(0 != main_~p4~0); 20247#L75-1 assume !(0 != main_~p5~0); 20237#L79-1 assume !(0 != main_~p6~0); 20239#L83-1 assume !(0 != main_~p7~0); 20298#L87-1 assume !(0 != main_~p8~0); 20211#L91-1 assume !(0 != main_~p9~0); 20213#L95-1 assume !(0 != main_~p1~0); 20272#L101-1 assume !(0 != main_~p2~0); 20338#L106-1 assume !(0 != main_~p3~0); 20334#L111-1 assume !(0 != main_~p4~0); 20331#L116-1 assume !(0 != main_~p5~0); 20328#L121-1 assume !(0 != main_~p6~0); 20326#L126-1 assume !(0 != main_~p7~0); 20324#L131-1 assume !(0 != main_~p8~0); 20322#L136-1 assume !(0 != main_~p9~0); 19730#L141-1 [2021-08-31 02:03:08,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:08,734 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-08-31 02:03:08,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:08,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005600379] [2021-08-31 02:03:08,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:08,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:08,741 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:03:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:08,748 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:03:08,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:08,749 INFO L82 PathProgramCache]: Analyzing trace with hash -904403051, now seen corresponding path program 1 times [2021-08-31 02:03:08,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:08,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829132426] [2021-08-31 02:03:08,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:08,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:08,753 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:03:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:08,758 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:03:08,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:03:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash 551712343, now seen corresponding path program 1 times [2021-08-31 02:03:08,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:03:08,759 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070432346] [2021-08-31 02:03:08,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:03:08,760 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:03:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:08,765 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:03:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:03:08,774 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:03:09,209 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:03:09,214 INFO L158 Benchmark]: Toolchain (without parser) took 4214.51ms. Allocated memory was 54.5MB in the beginning and 130.0MB in the end (delta: 75.5MB). Free memory was 37.2MB in the beginning and 66.9MB in the end (delta: -29.7MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. [2021-08-31 02:03:09,215 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 44.0MB. Free memory was 26.1MB in the beginning and 26.1MB in the end (delta: 43.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 02:03:09,216 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.96ms. Allocated memory is still 54.5MB. Free memory was 37.0MB in the beginning and 37.7MB in the end (delta: -789.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-08-31 02:03:09,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.70ms. Allocated memory is still 54.5MB. Free memory was 37.7MB in the beginning and 36.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 02:03:09,225 INFO L158 Benchmark]: Boogie Preprocessor took 71.60ms. Allocated memory is still 54.5MB. Free memory was 36.1MB in the beginning and 34.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 02:03:09,225 INFO L158 Benchmark]: RCFGBuilder took 266.97ms. Allocated memory is still 54.5MB. Free memory was 34.9MB in the beginning and 36.5MB in the end (delta: -1.6MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2021-08-31 02:03:09,225 INFO L158 Benchmark]: BuchiAutomizer took 3286.46ms. Allocated memory was 54.5MB in the beginning and 130.0MB in the end (delta: 75.5MB). Free memory was 36.3MB in the beginning and 66.9MB in the end (delta: -30.6MB). Peak memory consumption was 68.5MB. Max. memory is 16.1GB. [2021-08-31 02:03:09,227 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.20ms. Allocated memory is still 44.0MB. Free memory was 26.1MB in the beginning and 26.1MB in the end (delta: 43.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.96ms. Allocated memory is still 54.5MB. Free memory was 37.0MB in the beginning and 37.7MB in the end (delta: -789.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.70ms. Allocated memory is still 54.5MB. Free memory was 37.7MB in the beginning and 36.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.60ms. Allocated memory is still 54.5MB. Free memory was 36.1MB in the beginning and 34.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 266.97ms. Allocated memory is still 54.5MB. Free memory was 34.9MB in the beginning and 36.5MB in the end (delta: -1.6MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 3286.46ms. Allocated memory was 54.5MB in the beginning and 130.0MB in the end (delta: 75.5MB). Free memory was 36.3MB in the beginning and 66.9MB in the end (delta: -30.6MB). Peak memory consumption was 68.5MB. 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 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 6402 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:03:09,272 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...