./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec 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_11.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 a93221bc263791497331acd2a7a0150037c621aa ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 14:40:47,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 14:40:47,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 14:40:47,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 14:40:47,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 14:40:47,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 14:40:47,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 14:40:47,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 14:40:47,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 14:40:47,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 14:40:47,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 14:40:47,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 14:40:47,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 14:40:47,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 14:40:47,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 14:40:47,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 14:40:47,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 14:40:47,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 14:40:47,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 14:40:47,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 14:40:48,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 14:40:48,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 14:40:48,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 14:40:48,004 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 14:40:48,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 14:40:48,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 14:40:48,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 14:40:48,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 14:40:48,013 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 14:40:48,014 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 14:40:48,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 14:40:48,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 14:40:48,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 14:40:48,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 14:40:48,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 14:40:48,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 14:40:48,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 14:40:48,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 14:40:48,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 14:40:48,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 14:40:48,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 14:40:48,025 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 14:40:48,067 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 14:40:48,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 14:40:48,068 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 14:40:48,069 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 14:40:48,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 14:40:48,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 14:40:48,071 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 14:40:48,071 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 14:40:48,071 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 14:40:48,071 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 14:40:48,072 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 14:40:48,072 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 14:40:48,073 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 14:40:48,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 14:40:48,073 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 14:40:48,073 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 14:40:48,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 14:40:48,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 14:40:48,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 14:40:48,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 14:40:48,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 14:40:48,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 14:40:48,081 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 14:40:48,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 14:40:48,082 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 14:40:48,082 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 14:40:48,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 14:40:48,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 14:40:48,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 14:40:48,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 14:40:48,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 14:40:48,083 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 14:40:48,084 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 14:40:48,084 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 -> a93221bc263791497331acd2a7a0150037c621aa [2021-08-27 14:40:48,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 14:40:48,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 14:40:48,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 14:40:48,643 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 14:40:48,644 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 14:40:48,645 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2021-08-27 14:40:48,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52141aee1/ec18dc24d119497aab69f8d98184c20d/FLAG284180caa [2021-08-27 14:40:49,164 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 14:40:49,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2021-08-27 14:40:49,177 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52141aee1/ec18dc24d119497aab69f8d98184c20d/FLAG284180caa [2021-08-27 14:40:49,194 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52141aee1/ec18dc24d119497aab69f8d98184c20d [2021-08-27 14:40:49,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 14:40:49,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 14:40:49,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 14:40:49,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 14:40:49,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 14:40:49,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:40:49" (1/1) ... [2021-08-27 14:40:49,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41418556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:49, skipping insertion in model container [2021-08-27 14:40:49,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:40:49" (1/1) ... [2021-08-27 14:40:49,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 14:40:49,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 14:40:49,410 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_11.c[4246,4259] [2021-08-27 14:40:49,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:40:49,422 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 14:40:49,472 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_11.c[4246,4259] [2021-08-27 14:40:49,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:40:49,484 INFO L208 MainTranslator]: Completed translation [2021-08-27 14:40:49,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:49 WrapperNode [2021-08-27 14:40:49,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 14:40:49,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 14:40:49,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 14:40:49,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 14:40:49,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:49" (1/1) ... [2021-08-27 14:40:49,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:49" (1/1) ... [2021-08-27 14:40:49,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 14:40:49,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 14:40:49,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 14:40:49,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 14:40:49,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:49" (1/1) ... [2021-08-27 14:40:49,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:49" (1/1) ... [2021-08-27 14:40:49,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:49" (1/1) ... [2021-08-27 14:40:49,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:49" (1/1) ... [2021-08-27 14:40:49,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:49" (1/1) ... [2021-08-27 14:40:49,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:49" (1/1) ... [2021-08-27 14:40:49,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:49" (1/1) ... [2021-08-27 14:40:49,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 14:40:49,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 14:40:49,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 14:40:49,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 14:40:49,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:49" (1/1) ... [2021-08-27 14:40:49,582 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:40:49,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:40:49,599 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-27 14:40:49,627 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-27 14:40:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 14:40:49,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 14:40:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 14:40:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 14:40:50,102 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 14:40:50,102 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-27 14:40:50,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:40:50 BoogieIcfgContainer [2021-08-27 14:40:50,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 14:40:50,105 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 14:40:50,105 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 14:40:50,108 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 14:40:50,109 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:40:50,109 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 02:40:49" (1/3) ... [2021-08-27 14:40:50,110 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36ba7eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:40:50, skipping insertion in model container [2021-08-27 14:40:50,110 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:40:50,110 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:49" (2/3) ... [2021-08-27 14:40:50,110 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36ba7eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:40:50, skipping insertion in model container [2021-08-27 14:40:50,111 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:40:50,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:40:50" (3/3) ... [2021-08-27 14:40:50,112 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_11.c [2021-08-27 14:40:50,164 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 14:40:50,164 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 14:40:50,164 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 14:40:50,164 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 14:40:50,165 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 14:40:50,165 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 14:40:50,165 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 14:40:50,165 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 14:40:50,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 0 states have call successors, (0), 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-27 14:40:50,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-08-27 14:40:50,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:50,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:50,201 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:50,201 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:40:50,201 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 14:40:50,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 0 states have call successors, (0), 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-27 14:40:50,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-08-27 14:40:50,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:50,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:50,210 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:50,210 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:40:50,216 INFO L791 eck$LassoCheckResult]: Stem: 24#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 10#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 28#L169-1true [2021-08-27 14:40:50,217 INFO L793 eck$LassoCheckResult]: Loop: 28#L169-1true assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 15#L46true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 41#L73true assume 0 != main_~p1~0;main_~lk1~0 := 1; 42#L73-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 29#L77-1true assume !(0 != main_~p3~0); 6#L81-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 25#L85-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 19#L89-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 13#L93-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 22#L97-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 30#L101-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 36#L105-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 26#L109-1true assume !(0 != main_~p11~0); 21#L113-1true assume !(0 != main_~p1~0); 37#L119-1true assume !(0 != main_~p2~0); 9#L124-1true assume !(0 != main_~p3~0); 12#L129-1true assume !(0 != main_~p4~0); 20#L134-1true assume !(0 != main_~p5~0); 11#L139-1true assume !(0 != main_~p6~0); 4#L144-1true assume !(0 != main_~p7~0); 35#L149-1true assume !(0 != main_~p8~0); 18#L154-1true assume !(0 != main_~p9~0); 8#L159-1true assume !(0 != main_~p10~0); 39#L164-1true assume !(0 != main_~p11~0); 28#L169-1true [2021-08-27 14:40:50,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:50,222 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 14:40:50,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:50,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052432593] [2021-08-27 14:40:50,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:50,231 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:50,312 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:50,341 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:50,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:50,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1430849892, now seen corresponding path program 1 times [2021-08-27 14:40:50,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:50,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853307284] [2021-08-27 14:40:50,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:50,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:40:50,458 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-27 14:40:50,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:40:50,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853307284] [2021-08-27 14:40:50,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853307284] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:40:50,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:40:50,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:40:50,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326606684] [2021-08-27 14:40:50,464 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:40:50,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:40:50,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:40:50,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:40:50,487 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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-27 14:40:50,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:40:50,543 INFO L93 Difference]: Finished difference Result 81 states and 142 transitions. [2021-08-27 14:40:50,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:40:50,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 142 transitions. [2021-08-27 14:40:50,553 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2021-08-27 14:40:50,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 71 states and 113 transitions. [2021-08-27 14:40:50,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2021-08-27 14:40:50,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2021-08-27 14:40:50,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 113 transitions. [2021-08-27 14:40:50,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:40:50,563 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2021-08-27 14:40:50,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 113 transitions. [2021-08-27 14:40:50,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-08-27 14:40:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.591549295774648) internal successors, (113), 70 states have internal predecessors, (113), 0 states have call successors, (0), 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-27 14:40:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 113 transitions. [2021-08-27 14:40:50,593 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2021-08-27 14:40:50,593 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2021-08-27 14:40:50,593 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 14:40:50,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 113 transitions. [2021-08-27 14:40:50,596 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2021-08-27 14:40:50,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:50,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:50,597 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:50,597 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:40:50,598 INFO L791 eck$LassoCheckResult]: Stem: 164#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 145#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 146#L169-1 [2021-08-27 14:40:50,598 INFO L793 eck$LassoCheckResult]: Loop: 146#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 179#L46 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 178#L73 assume !(0 != main_~p1~0); 174#L73-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 168#L77-1 assume !(0 != main_~p3~0); 135#L81-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 136#L85-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 159#L89-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 149#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 150#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 169#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 170#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 177#L109-1 assume !(0 != main_~p11~0); 175#L113-1 assume !(0 != main_~p1~0); 176#L119-1 assume !(0 != main_~p2~0); 196#L124-1 assume !(0 != main_~p3~0); 194#L129-1 assume !(0 != main_~p4~0); 192#L134-1 assume !(0 != main_~p5~0); 190#L139-1 assume !(0 != main_~p6~0); 188#L144-1 assume !(0 != main_~p7~0); 186#L149-1 assume !(0 != main_~p8~0); 157#L154-1 assume !(0 != main_~p9~0); 139#L159-1 assume !(0 != main_~p10~0); 141#L164-1 assume !(0 != main_~p11~0); 146#L169-1 [2021-08-27 14:40:50,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:50,599 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-27 14:40:50,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:50,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886293065] [2021-08-27 14:40:50,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:50,600 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:50,627 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:50,644 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:50,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:50,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1649704610, now seen corresponding path program 1 times [2021-08-27 14:40:50,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:50,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182608393] [2021-08-27 14:40:50,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:50,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:40:50,702 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-27 14:40:50,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:40:50,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182608393] [2021-08-27 14:40:50,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182608393] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:40:50,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:40:50,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:40:50,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627436241] [2021-08-27 14:40:50,708 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:40:50,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:40:50,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:40:50,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:40:50,711 INFO L87 Difference]: Start difference. First operand 71 states and 113 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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-27 14:40:50,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:40:50,756 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2021-08-27 14:40:50,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:40:50,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 218 transitions. [2021-08-27 14:40:50,759 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2021-08-27 14:40:50,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 218 transitions. [2021-08-27 14:40:50,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2021-08-27 14:40:50,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2021-08-27 14:40:50,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 218 transitions. [2021-08-27 14:40:50,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:40:50,767 INFO L681 BuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2021-08-27 14:40:50,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 218 transitions. [2021-08-27 14:40:50,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-08-27 14:40:50,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.5797101449275361) internal successors, (218), 137 states have internal predecessors, (218), 0 states have call successors, (0), 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-27 14:40:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 218 transitions. [2021-08-27 14:40:50,780 INFO L704 BuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2021-08-27 14:40:50,780 INFO L587 BuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2021-08-27 14:40:50,780 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 14:40:50,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 218 transitions. [2021-08-27 14:40:50,783 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2021-08-27 14:40:50,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:50,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:50,784 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:50,784 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:40:50,785 INFO L791 eck$LassoCheckResult]: Stem: 379#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 360#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 361#L169-1 [2021-08-27 14:40:50,785 INFO L793 eck$LassoCheckResult]: Loop: 361#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 369#L46 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 370#L73 assume !(0 != main_~p1~0); 425#L73-2 assume !(0 != main_~p2~0); 424#L77-1 assume !(0 != main_~p3~0); 421#L81-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 418#L85-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 415#L89-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 412#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 409#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 406#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 404#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 395#L109-1 assume !(0 != main_~p11~0); 396#L113-1 assume !(0 != main_~p1~0); 400#L119-1 assume !(0 != main_~p2~0); 357#L124-1 assume !(0 != main_~p3~0); 358#L129-1 assume !(0 != main_~p4~0); 353#L134-1 assume !(0 != main_~p5~0); 362#L139-1 assume !(0 != main_~p6~0); 363#L144-1 assume !(0 != main_~p7~0); 456#L149-1 assume !(0 != main_~p8~0); 454#L154-1 assume !(0 != main_~p9~0); 452#L159-1 assume !(0 != main_~p10~0); 388#L164-1 assume !(0 != main_~p11~0); 361#L169-1 [2021-08-27 14:40:50,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:50,787 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-27 14:40:50,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:50,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740693848] [2021-08-27 14:40:50,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:50,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:50,811 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:50,825 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:50,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:50,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2072406436, now seen corresponding path program 1 times [2021-08-27 14:40:50,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:50,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49772021] [2021-08-27 14:40:50,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:50,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:40:50,876 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-27 14:40:50,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:40:50,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49772021] [2021-08-27 14:40:50,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49772021] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:40:50,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:40:50,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:40:50,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229659284] [2021-08-27 14:40:50,878 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:40:50,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:40:50,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:40:50,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:40:50,879 INFO L87 Difference]: Start difference. First operand 138 states and 218 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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-27 14:40:50,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:40:50,903 INFO L93 Difference]: Finished difference Result 270 states and 422 transitions. [2021-08-27 14:40:50,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:40:50,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 422 transitions. [2021-08-27 14:40:50,906 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2021-08-27 14:40:50,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 422 transitions. [2021-08-27 14:40:50,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2021-08-27 14:40:50,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2021-08-27 14:40:50,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 422 transitions. [2021-08-27 14:40:50,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:40:50,913 INFO L681 BuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2021-08-27 14:40:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 422 transitions. [2021-08-27 14:40:50,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-08-27 14:40:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.5629629629629629) internal successors, (422), 269 states have internal predecessors, (422), 0 states have call successors, (0), 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-27 14:40:50,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 422 transitions. [2021-08-27 14:40:50,926 INFO L704 BuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2021-08-27 14:40:50,926 INFO L587 BuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2021-08-27 14:40:50,926 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 14:40:50,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 422 transitions. [2021-08-27 14:40:50,927 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2021-08-27 14:40:50,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:50,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:50,928 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:50,928 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:40:50,928 INFO L791 eck$LassoCheckResult]: Stem: 793#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 774#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 775#L169-1 [2021-08-27 14:40:50,928 INFO L793 eck$LassoCheckResult]: Loop: 775#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 917#L46 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 916#L73 assume !(0 != main_~p1~0); 914#L73-2 assume !(0 != main_~p2~0); 910#L77-1 assume !(0 != main_~p3~0); 906#L81-1 assume !(0 != main_~p4~0); 902#L85-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 898#L89-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 894#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 890#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 886#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 882#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 878#L109-1 assume !(0 != main_~p11~0); 872#L113-1 assume !(0 != main_~p1~0); 873#L119-1 assume !(0 != main_~p2~0); 940#L124-1 assume !(0 != main_~p3~0); 937#L129-1 assume !(0 != main_~p4~0); 936#L134-1 assume !(0 != main_~p5~0); 933#L139-1 assume !(0 != main_~p6~0); 848#L144-1 assume !(0 != main_~p7~0); 843#L149-1 assume !(0 != main_~p8~0); 842#L154-1 assume !(0 != main_~p9~0); 831#L159-1 assume !(0 != main_~p10~0); 830#L164-1 assume !(0 != main_~p11~0); 775#L169-1 [2021-08-27 14:40:50,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:50,929 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-27 14:40:50,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:50,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225367565] [2021-08-27 14:40:50,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:50,930 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:50,936 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:50,945 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:50,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:50,946 INFO L82 PathProgramCache]: Analyzing trace with hash 383462694, now seen corresponding path program 1 times [2021-08-27 14:40:50,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:50,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928120481] [2021-08-27 14:40:50,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:50,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:40:50,977 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-27 14:40:50,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:40:50,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928120481] [2021-08-27 14:40:50,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928120481] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:40:50,978 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:40:50,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:40:50,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51468118] [2021-08-27 14:40:50,979 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:40:50,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:40:50,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:40:50,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:40:50,980 INFO L87 Difference]: Start difference. First operand 270 states and 422 transitions. cyclomatic complexity: 160 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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-27 14:40:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:40:50,991 INFO L93 Difference]: Finished difference Result 530 states and 818 transitions. [2021-08-27 14:40:50,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:40:50,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 818 transitions. [2021-08-27 14:40:50,996 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2021-08-27 14:40:51,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 530 states and 818 transitions. [2021-08-27 14:40:51,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 530 [2021-08-27 14:40:51,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 530 [2021-08-27 14:40:51,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 530 states and 818 transitions. [2021-08-27 14:40:51,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:40:51,003 INFO L681 BuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2021-08-27 14:40:51,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states and 818 transitions. [2021-08-27 14:40:51,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2021-08-27 14:40:51,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 530 states have (on average 1.5433962264150944) internal successors, (818), 529 states have internal predecessors, (818), 0 states have call successors, (0), 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-27 14:40:51,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 818 transitions. [2021-08-27 14:40:51,023 INFO L704 BuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2021-08-27 14:40:51,023 INFO L587 BuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2021-08-27 14:40:51,023 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 14:40:51,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 530 states and 818 transitions. [2021-08-27 14:40:51,026 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2021-08-27 14:40:51,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:51,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:51,027 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:51,027 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:40:51,027 INFO L791 eck$LassoCheckResult]: Stem: 1600#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1580#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 1581#L169-1 [2021-08-27 14:40:51,027 INFO L793 eck$LassoCheckResult]: Loop: 1581#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 1663#L46 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 1661#L73 assume !(0 != main_~p1~0); 1657#L73-2 assume !(0 != main_~p2~0); 1655#L77-1 assume !(0 != main_~p3~0); 1651#L81-1 assume !(0 != main_~p4~0); 1647#L85-1 assume !(0 != main_~p5~0); 1645#L89-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1643#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1641#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1639#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1637#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1635#L109-1 assume !(0 != main_~p11~0); 1632#L113-1 assume !(0 != main_~p1~0); 1633#L119-1 assume !(0 != main_~p2~0); 1699#L124-1 assume !(0 != main_~p3~0); 1694#L129-1 assume !(0 != main_~p4~0); 1690#L134-1 assume !(0 != main_~p5~0); 1687#L139-1 assume !(0 != main_~p6~0); 1683#L144-1 assume !(0 != main_~p7~0); 1679#L149-1 assume !(0 != main_~p8~0); 1675#L154-1 assume !(0 != main_~p9~0); 1671#L159-1 assume !(0 != main_~p10~0); 1667#L164-1 assume !(0 != main_~p11~0); 1581#L169-1 [2021-08-27 14:40:51,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:51,028 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-08-27 14:40:51,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:51,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182738162] [2021-08-27 14:40:51,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:51,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:51,035 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:51,052 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:51,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:51,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1610682012, now seen corresponding path program 1 times [2021-08-27 14:40:51,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:51,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773835944] [2021-08-27 14:40:51,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:51,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:40:51,076 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-27 14:40:51,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:40:51,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773835944] [2021-08-27 14:40:51,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773835944] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:40:51,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:40:51,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:40:51,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196970784] [2021-08-27 14:40:51,078 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:40:51,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:40:51,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:40:51,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:40:51,080 INFO L87 Difference]: Start difference. First operand 530 states and 818 transitions. cyclomatic complexity: 304 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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-27 14:40:51,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:40:51,105 INFO L93 Difference]: Finished difference Result 1042 states and 1586 transitions. [2021-08-27 14:40:51,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:40:51,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1042 states and 1586 transitions. [2021-08-27 14:40:51,114 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2021-08-27 14:40:51,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1042 states to 1042 states and 1586 transitions. [2021-08-27 14:40:51,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1042 [2021-08-27 14:40:51,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1042 [2021-08-27 14:40:51,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1042 states and 1586 transitions. [2021-08-27 14:40:51,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:40:51,126 INFO L681 BuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2021-08-27 14:40:51,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states and 1586 transitions. [2021-08-27 14:40:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2021-08-27 14:40:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1042 states have (on average 1.5220729366602688) internal successors, (1586), 1041 states have internal predecessors, (1586), 0 states have call successors, (0), 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-27 14:40:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1586 transitions. [2021-08-27 14:40:51,162 INFO L704 BuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2021-08-27 14:40:51,162 INFO L587 BuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2021-08-27 14:40:51,162 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 14:40:51,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1042 states and 1586 transitions. [2021-08-27 14:40:51,167 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2021-08-27 14:40:51,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:51,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:51,168 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:51,168 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:40:51,168 INFO L791 eck$LassoCheckResult]: Stem: 3176#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3158#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 3159#L169-1 [2021-08-27 14:40:51,168 INFO L793 eck$LassoCheckResult]: Loop: 3159#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 3298#L46 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 3294#L73 assume !(0 != main_~p1~0); 3290#L73-2 assume !(0 != main_~p2~0); 3288#L77-1 assume !(0 != main_~p3~0); 3286#L81-1 assume !(0 != main_~p4~0); 3282#L85-1 assume !(0 != main_~p5~0); 3278#L89-1 assume !(0 != main_~p6~0); 3276#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3274#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3272#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3270#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3268#L109-1 assume !(0 != main_~p11~0); 3264#L113-1 assume !(0 != main_~p1~0); 3260#L119-1 assume !(0 != main_~p2~0); 3257#L124-1 assume !(0 != main_~p3~0); 3253#L129-1 assume !(0 != main_~p4~0); 3254#L134-1 assume !(0 != main_~p5~0); 3321#L139-1 assume !(0 != main_~p6~0); 3318#L144-1 assume !(0 != main_~p7~0); 3314#L149-1 assume !(0 != main_~p8~0); 3310#L154-1 assume !(0 != main_~p9~0); 3306#L159-1 assume !(0 != main_~p10~0); 3302#L164-1 assume !(0 != main_~p11~0); 3159#L169-1 [2021-08-27 14:40:51,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:51,169 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-08-27 14:40:51,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:51,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995122829] [2021-08-27 14:40:51,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:51,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:51,182 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:51,194 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:51,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:51,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1095937382, now seen corresponding path program 1 times [2021-08-27 14:40:51,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:51,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451813794] [2021-08-27 14:40:51,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:51,198 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:40:51,225 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-27 14:40:51,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:40:51,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451813794] [2021-08-27 14:40:51,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451813794] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:40:51,226 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:40:51,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:40:51,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886079523] [2021-08-27 14:40:51,227 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:40:51,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:40:51,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:40:51,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:40:51,228 INFO L87 Difference]: Start difference. First operand 1042 states and 1586 transitions. cyclomatic complexity: 576 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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-27 14:40:51,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:40:51,255 INFO L93 Difference]: Finished difference Result 2050 states and 3074 transitions. [2021-08-27 14:40:51,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:40:51,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 3074 transitions. [2021-08-27 14:40:51,274 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2021-08-27 14:40:51,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 3074 transitions. [2021-08-27 14:40:51,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2021-08-27 14:40:51,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2021-08-27 14:40:51,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 3074 transitions. [2021-08-27 14:40:51,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:40:51,291 INFO L681 BuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2021-08-27 14:40:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 3074 transitions. [2021-08-27 14:40:51,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2021-08-27 14:40:51,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 2050 states have (on average 1.4995121951219512) internal successors, (3074), 2049 states have internal predecessors, (3074), 0 states have call successors, (0), 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-27 14:40:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3074 transitions. [2021-08-27 14:40:51,331 INFO L704 BuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2021-08-27 14:40:51,331 INFO L587 BuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2021-08-27 14:40:51,331 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 14:40:51,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2050 states and 3074 transitions. [2021-08-27 14:40:51,341 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2021-08-27 14:40:51,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:51,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:51,342 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:51,342 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:40:51,342 INFO L791 eck$LassoCheckResult]: Stem: 6275#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 6255#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 6256#L169-1 [2021-08-27 14:40:51,342 INFO L793 eck$LassoCheckResult]: Loop: 6256#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 6363#L46 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 6361#L73 assume !(0 != main_~p1~0); 6357#L73-2 assume !(0 != main_~p2~0); 6355#L77-1 assume !(0 != main_~p3~0); 6351#L81-1 assume !(0 != main_~p4~0); 6347#L85-1 assume !(0 != main_~p5~0); 6343#L89-1 assume !(0 != main_~p6~0); 6339#L93-1 assume !(0 != main_~p7~0); 6337#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 6335#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 6333#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 6331#L109-1 assume !(0 != main_~p11~0); 6328#L113-1 assume !(0 != main_~p1~0); 6329#L119-1 assume !(0 != main_~p2~0); 6399#L124-1 assume !(0 != main_~p3~0); 6394#L129-1 assume !(0 != main_~p4~0); 6390#L134-1 assume !(0 != main_~p5~0); 6386#L139-1 assume !(0 != main_~p6~0); 6382#L144-1 assume !(0 != main_~p7~0); 6379#L149-1 assume !(0 != main_~p8~0); 6375#L154-1 assume !(0 != main_~p9~0); 6371#L159-1 assume !(0 != main_~p10~0); 6367#L164-1 assume !(0 != main_~p11~0); 6256#L169-1 [2021-08-27 14:40:51,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:51,343 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-08-27 14:40:51,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:51,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867242980] [2021-08-27 14:40:51,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:51,343 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:51,349 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:51,357 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:51,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:51,358 INFO L82 PathProgramCache]: Analyzing trace with hash 74869028, now seen corresponding path program 1 times [2021-08-27 14:40:51,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:51,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818929353] [2021-08-27 14:40:51,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:51,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:40:51,375 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-27 14:40:51,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:40:51,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818929353] [2021-08-27 14:40:51,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818929353] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:40:51,375 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:40:51,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:40:51,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116153987] [2021-08-27 14:40:51,376 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:40:51,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:40:51,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:40:51,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:40:51,377 INFO L87 Difference]: Start difference. First operand 2050 states and 3074 transitions. cyclomatic complexity: 1088 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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-27 14:40:51,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:40:51,415 INFO L93 Difference]: Finished difference Result 4034 states and 5954 transitions. [2021-08-27 14:40:51,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:40:51,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4034 states and 5954 transitions. [2021-08-27 14:40:51,446 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2021-08-27 14:40:51,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4034 states to 4034 states and 5954 transitions. [2021-08-27 14:40:51,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4034 [2021-08-27 14:40:51,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4034 [2021-08-27 14:40:51,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4034 states and 5954 transitions. [2021-08-27 14:40:51,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:40:51,478 INFO L681 BuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2021-08-27 14:40:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states and 5954 transitions. [2021-08-27 14:40:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2021-08-27 14:40:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4034 states, 4034 states have (on average 1.4759543877045116) internal successors, (5954), 4033 states have internal predecessors, (5954), 0 states have call successors, (0), 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-27 14:40:51,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 5954 transitions. [2021-08-27 14:40:51,574 INFO L704 BuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2021-08-27 14:40:51,574 INFO L587 BuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2021-08-27 14:40:51,575 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 14:40:51,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4034 states and 5954 transitions. [2021-08-27 14:40:51,618 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2021-08-27 14:40:51,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:51,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:51,619 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:51,619 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:40:51,619 INFO L791 eck$LassoCheckResult]: Stem: 12367#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 12345#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 12346#L169-1 [2021-08-27 14:40:51,619 INFO L793 eck$LassoCheckResult]: Loop: 12346#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 12506#L46 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 12500#L73 assume !(0 != main_~p1~0); 12494#L73-2 assume !(0 != main_~p2~0); 12495#L77-1 assume !(0 != main_~p3~0); 12689#L81-1 assume !(0 != main_~p4~0); 12687#L85-1 assume !(0 != main_~p5~0); 12685#L89-1 assume !(0 != main_~p6~0); 12450#L93-1 assume !(0 != main_~p7~0); 12452#L97-1 assume !(0 != main_~p8~0); 12638#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 12634#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 12630#L109-1 assume !(0 != main_~p11~0); 12626#L113-1 assume !(0 != main_~p1~0); 12627#L119-1 assume !(0 != main_~p2~0); 12684#L124-1 assume !(0 != main_~p3~0); 12681#L129-1 assume !(0 != main_~p4~0); 12679#L134-1 assume !(0 != main_~p5~0); 12677#L139-1 assume !(0 != main_~p6~0); 12675#L144-1 assume !(0 != main_~p7~0); 12672#L149-1 assume !(0 != main_~p8~0); 12670#L154-1 assume !(0 != main_~p9~0); 12532#L159-1 assume !(0 != main_~p10~0); 12518#L164-1 assume !(0 != main_~p11~0); 12346#L169-1 [2021-08-27 14:40:51,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:51,620 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-08-27 14:40:51,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:51,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174674147] [2021-08-27 14:40:51,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:51,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:51,633 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:51,650 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:51,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:51,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1204994650, now seen corresponding path program 1 times [2021-08-27 14:40:51,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:51,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405222292] [2021-08-27 14:40:51,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:51,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:40:51,667 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-27 14:40:51,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:40:51,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405222292] [2021-08-27 14:40:51,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405222292] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:40:51,667 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:40:51,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:40:51,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616917964] [2021-08-27 14:40:51,668 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:40:51,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:40:51,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:40:51,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:40:51,669 INFO L87 Difference]: Start difference. First operand 4034 states and 5954 transitions. cyclomatic complexity: 2048 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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-27 14:40:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:40:51,726 INFO L93 Difference]: Finished difference Result 7938 states and 11522 transitions. [2021-08-27 14:40:51,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:40:51,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7938 states and 11522 transitions. [2021-08-27 14:40:51,786 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2021-08-27 14:40:51,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7938 states to 7938 states and 11522 transitions. [2021-08-27 14:40:51,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7938 [2021-08-27 14:40:51,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7938 [2021-08-27 14:40:51,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7938 states and 11522 transitions. [2021-08-27 14:40:51,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:40:51,863 INFO L681 BuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2021-08-27 14:40:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states and 11522 transitions. [2021-08-27 14:40:52,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 7938. [2021-08-27 14:40:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7938 states, 7938 states have (on average 1.4514991181657848) internal successors, (11522), 7937 states have internal predecessors, (11522), 0 states have call successors, (0), 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-27 14:40:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7938 states to 7938 states and 11522 transitions. [2021-08-27 14:40:52,126 INFO L704 BuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2021-08-27 14:40:52,126 INFO L587 BuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2021-08-27 14:40:52,127 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 14:40:52,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7938 states and 11522 transitions. [2021-08-27 14:40:52,164 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2021-08-27 14:40:52,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:52,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:52,166 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:52,166 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:40:52,166 INFO L791 eck$LassoCheckResult]: Stem: 24342#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 24323#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 24324#L169-1 [2021-08-27 14:40:52,166 INFO L793 eck$LassoCheckResult]: Loop: 24324#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 24735#L46 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 24728#L73 assume !(0 != main_~p1~0); 24720#L73-2 assume !(0 != main_~p2~0); 24716#L77-1 assume !(0 != main_~p3~0); 24714#L81-1 assume !(0 != main_~p4~0); 24712#L85-1 assume !(0 != main_~p5~0); 24710#L89-1 assume !(0 != main_~p6~0); 24709#L93-1 assume !(0 != main_~p7~0); 24707#L97-1 assume !(0 != main_~p8~0); 24706#L101-1 assume !(0 != main_~p9~0); 24702#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 24699#L109-1 assume !(0 != main_~p11~0); 24695#L113-1 assume !(0 != main_~p1~0); 24681#L119-1 assume !(0 != main_~p2~0); 24678#L124-1 assume !(0 != main_~p3~0); 24669#L129-1 assume !(0 != main_~p4~0); 24659#L134-1 assume !(0 != main_~p5~0); 24649#L139-1 assume !(0 != main_~p6~0); 24639#L144-1 assume !(0 != main_~p7~0); 24630#L149-1 assume !(0 != main_~p8~0); 24631#L154-1 assume !(0 != main_~p9~0); 24832#L159-1 assume !(0 != main_~p10~0); 24746#L164-1 assume !(0 != main_~p11~0); 24324#L169-1 [2021-08-27 14:40:52,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:52,167 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-08-27 14:40:52,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:52,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804698086] [2021-08-27 14:40:52,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:52,168 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:52,188 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:52,202 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:52,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash 2078855396, now seen corresponding path program 1 times [2021-08-27 14:40:52,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:52,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270044012] [2021-08-27 14:40:52,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:52,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:40:52,227 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-27 14:40:52,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:40:52,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270044012] [2021-08-27 14:40:52,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270044012] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:40:52,228 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:40:52,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:40:52,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885222695] [2021-08-27 14:40:52,232 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:40:52,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:40:52,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:40:52,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:40:52,234 INFO L87 Difference]: Start difference. First operand 7938 states and 11522 transitions. cyclomatic complexity: 3840 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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-27 14:40:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:40:52,347 INFO L93 Difference]: Finished difference Result 15618 states and 22274 transitions. [2021-08-27 14:40:52,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:40:52,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15618 states and 22274 transitions. [2021-08-27 14:40:52,460 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2021-08-27 14:40:52,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15618 states to 15618 states and 22274 transitions. [2021-08-27 14:40:52,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15618 [2021-08-27 14:40:52,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15618 [2021-08-27 14:40:52,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15618 states and 22274 transitions. [2021-08-27 14:40:52,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:40:52,557 INFO L681 BuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2021-08-27 14:40:52,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15618 states and 22274 transitions. [2021-08-27 14:40:52,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15618 to 15618. [2021-08-27 14:40:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15618 states, 15618 states have (on average 1.4261749263670125) internal successors, (22274), 15617 states have internal predecessors, (22274), 0 states have call successors, (0), 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-27 14:40:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15618 states to 15618 states and 22274 transitions. [2021-08-27 14:40:52,874 INFO L704 BuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2021-08-27 14:40:52,874 INFO L587 BuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2021-08-27 14:40:52,874 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 14:40:52,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15618 states and 22274 transitions. [2021-08-27 14:40:52,940 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2021-08-27 14:40:52,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:52,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:52,943 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:52,943 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:40:52,943 INFO L791 eck$LassoCheckResult]: Stem: 47906#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 47884#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 47885#L169-1 [2021-08-27 14:40:52,944 INFO L793 eck$LassoCheckResult]: Loop: 47885#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 48601#L46 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 48598#L73 assume !(0 != main_~p1~0); 48594#L73-2 assume !(0 != main_~p2~0); 48591#L77-1 assume !(0 != main_~p3~0); 48588#L81-1 assume !(0 != main_~p4~0); 48584#L85-1 assume !(0 != main_~p5~0); 48580#L89-1 assume !(0 != main_~p6~0); 48576#L93-1 assume !(0 != main_~p7~0); 48572#L97-1 assume !(0 != main_~p8~0); 48568#L101-1 assume !(0 != main_~p9~0); 48569#L105-1 assume !(0 != main_~p10~0); 48527#L109-1 assume !(0 != main_~p11~0); 48528#L113-1 assume !(0 != main_~p1~0); 48643#L119-1 assume !(0 != main_~p2~0); 48637#L124-1 assume !(0 != main_~p3~0); 48631#L129-1 assume !(0 != main_~p4~0); 48626#L134-1 assume !(0 != main_~p5~0); 48622#L139-1 assume !(0 != main_~p6~0); 48617#L144-1 assume !(0 != main_~p7~0); 48612#L149-1 assume !(0 != main_~p8~0); 48609#L154-1 assume !(0 != main_~p9~0); 48607#L159-1 assume !(0 != main_~p10~0); 48606#L164-1 assume !(0 != main_~p11~0); 47885#L169-1 [2021-08-27 14:40:52,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:52,945 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-08-27 14:40:52,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:52,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477617255] [2021-08-27 14:40:52,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:52,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:52,954 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:52,966 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:52,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:52,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1492049382, now seen corresponding path program 1 times [2021-08-27 14:40:52,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:52,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450419085] [2021-08-27 14:40:52,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:52,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:52,970 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:52,983 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:52,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:52,986 INFO L82 PathProgramCache]: Analyzing trace with hash 376454056, now seen corresponding path program 1 times [2021-08-27 14:40:52,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:52,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138839495] [2021-08-27 14:40:52,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:52,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:52,997 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:53,012 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:53,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 02:40:53 BoogieIcfgContainer [2021-08-27 14:40:53,704 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 14:40:53,704 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 14:40:53,704 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 14:40:53,705 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 14:40:53,705 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:40:50" (3/4) ... [2021-08-27 14:40:53,707 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 14:40:53,757 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 14:40:53,757 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 14:40:53,758 INFO L168 Benchmark]: Toolchain (without parser) took 4558.48 ms. Allocated memory was 52.4 MB in the beginning and 455.1 MB in the end (delta: 402.7 MB). Free memory was 29.1 MB in the beginning and 227.9 MB in the end (delta: -198.8 MB). Peak memory consumption was 203.5 MB. Max. memory is 16.1 GB. [2021-08-27 14:40:53,759 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 52.4 MB. Free memory was 34.2 MB in the beginning and 34.2 MB in the end (delta: 37.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:40:53,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.03 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 28.9 MB in the beginning and 45.8 MB in the end (delta: -16.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. [2021-08-27 14:40:53,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.16 ms. Allocated memory is still 62.9 MB. Free memory was 45.6 MB in the beginning and 44.0 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:40:53,759 INFO L168 Benchmark]: Boogie Preprocessor took 45.59 ms. Allocated memory is still 62.9 MB. Free memory was 44.0 MB in the beginning and 42.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:40:53,760 INFO L168 Benchmark]: RCFGBuilder took 532.92 ms. Allocated memory is still 62.9 MB. Free memory was 42.7 MB in the beginning and 39.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 16.1 GB. [2021-08-27 14:40:53,760 INFO L168 Benchmark]: BuchiAutomizer took 3598.81 ms. Allocated memory was 62.9 MB in the beginning and 455.1 MB in the end (delta: 392.2 MB). Free memory was 39.3 MB in the beginning and 231.1 MB in the end (delta: -191.8 MB). Peak memory consumption was 219.5 MB. Max. memory is 16.1 GB. [2021-08-27 14:40:53,760 INFO L168 Benchmark]: Witness Printer took 52.49 ms. Allocated memory is still 455.1 MB. Free memory was 231.1 MB in the beginning and 227.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 14:40:53,762 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.13 ms. Allocated memory is still 52.4 MB. Free memory was 34.2 MB in the beginning and 34.2 MB in the end (delta: 37.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 283.03 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 28.9 MB in the beginning and 45.8 MB in the end (delta: -16.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.16 ms. Allocated memory is still 62.9 MB. Free memory was 45.6 MB in the beginning and 44.0 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 45.59 ms. Allocated memory is still 62.9 MB. Free memory was 44.0 MB in the beginning and 42.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 532.92 ms. Allocated memory is still 62.9 MB. Free memory was 42.7 MB in the beginning and 39.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 3598.81 ms. Allocated memory was 62.9 MB in the beginning and 455.1 MB in the end (delta: 392.2 MB). Free memory was 39.3 MB in the beginning and 231.1 MB in the end (delta: -191.8 MB). Peak memory consumption was 219.5 MB. Max. memory is 16.1 GB. * Witness Printer took 52.49 ms. Allocated memory is still 455.1 MB. Free memory was 231.1 MB in the beginning and 227.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 15618 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 815.5ms AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 15618 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 796 SDtfs, 411 SDslu, 491 SDs, 0 SdLazy, 45 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 97.7ms Time LassoAnalysisResults: nont1 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 44]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=14756} State at position 1 is {NULL=14759, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=14756, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7501bab0=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@733c14f3=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@354ad1ef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@386d3dfa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4041c47d=0, p11=0, lk10=0, lk11=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@329c893a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7fd79cc9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@784d22b0=10, cond=10, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5349db0a=0, NULL=14758, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30efad25=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61bcd42f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f909649=0, NULL=0, NULL=0, NULL=0, NULL=14757, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 44]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-08-27 14:40:53,800 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...