./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8d31f386 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_8.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 37d0ed05d77a0379c9ed98058bf2f327252773ce ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-wip.dd.multireach-323-8d31f38 [2021-07-06 19:03:55,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 19:03:55,550 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 19:03:55,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 19:03:55,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 19:03:55,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 19:03:55,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 19:03:55,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 19:03:55,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 19:03:55,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 19:03:55,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 19:03:55,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 19:03:55,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 19:03:55,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 19:03:55,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 19:03:55,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 19:03:55,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 19:03:55,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 19:03:55,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 19:03:55,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 19:03:55,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 19:03:55,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 19:03:55,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 19:03:55,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 19:03:55,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 19:03:55,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 19:03:55,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 19:03:55,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 19:03:55,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 19:03:55,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 19:03:55,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 19:03:55,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 19:03:55,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 19:03:55,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 19:03:55,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 19:03:55,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 19:03:55,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 19:03:55,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 19:03:55,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 19:03:55,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 19:03:55,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 19:03:55,625 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-07-06 19:03:55,649 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 19:03:55,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 19:03:55,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 19:03:55,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 19:03:55,651 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 19:03:55,651 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 19:03:55,651 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 19:03:55,652 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 19:03:55,652 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 19:03:55,652 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 19:03:55,653 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 19:03:55,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 19:03:55,653 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 19:03:55,653 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 19:03:55,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 19:03:55,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 19:03:55,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 19:03:55,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 19:03:55,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 19:03:55,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 19:03:55,654 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 19:03:55,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 19:03:55,655 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 19:03:55,655 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 19:03:55,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 19:03:55,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 19:03:55,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 19:03:55,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 19:03:55,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 19:03:55,656 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 19:03:55,657 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 19:03:55,657 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 -> 37d0ed05d77a0379c9ed98058bf2f327252773ce [2021-07-06 19:03:55,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 19:03:55,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 19:03:55,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 19:03:55,890 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 19:03:55,890 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 19:03:55,891 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2021-07-06 19:03:55,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ee5ac4e8/fc0e97c115a7459cb22cc01644086a49/FLAGdfae2f218 [2021-07-06 19:03:56,298 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 19:03:56,299 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2021-07-06 19:03:56,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ee5ac4e8/fc0e97c115a7459cb22cc01644086a49/FLAGdfae2f218 [2021-07-06 19:03:56,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ee5ac4e8/fc0e97c115a7459cb22cc01644086a49 [2021-07-06 19:03:56,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 19:03:56,726 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 19:03:56,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 19:03:56,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 19:03:56,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 19:03:56,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14a6420b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56, skipping insertion in model container [2021-07-06 19:03:56,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 19:03:56,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 19:03:56,841 WARN L224 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_8.c[3218,3231] [2021-07-06 19:03:56,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 19:03:56,856 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 19:03:56,889 WARN L224 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_8.c[3218,3231] [2021-07-06 19:03:56,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 19:03:56,909 INFO L208 MainTranslator]: Completed translation [2021-07-06 19:03:56,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56 WrapperNode [2021-07-06 19:03:56,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 19:03:56,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 19:03:56,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 19:03:56,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 19:03:56,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 19:03:56,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 19:03:56,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 19:03:56,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 19:03:56,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 19:03:56,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 19:03:56,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 19:03:56,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 19:03:56,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,985 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 19:03:56,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 19:03:57,022 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-07-06 19:03:57,047 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-07-06 19:03:57,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 19:03:57,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 19:03:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 19:03:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 19:03:57,347 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 19:03:57,348 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-07-06 19:03:57,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 07:03:57 BoogieIcfgContainer [2021-07-06 19:03:57,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 19:03:57,349 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 19:03:57,350 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 19:03:57,351 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 19:03:57,352 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 19:03:57,352 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 07:03:56" (1/3) ... [2021-07-06 19:03:57,353 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76918090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 07:03:57, skipping insertion in model container [2021-07-06 19:03:57,353 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 19:03:57,353 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (2/3) ... [2021-07-06 19:03:57,353 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76918090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 07:03:57, skipping insertion in model container [2021-07-06 19:03:57,353 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 19:03:57,353 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 07:03:57" (3/3) ... [2021-07-06 19:03:57,354 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_8.c [2021-07-06 19:03:57,395 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 19:03:57,397 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 19:03:57,397 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 19:03:57,397 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 19:03:57,397 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 19:03:57,397 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 19:03:57,398 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 19:03:57,398 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 19:03:57,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 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-07-06 19:03:57,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2021-07-06 19:03:57,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:57,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:57,426 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:57,426 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:57,427 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 19:03:57,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 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-07-06 19:03:57,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2021-07-06 19:03:57,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:57,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:57,432 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:57,432 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:57,436 INFO L791 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 11#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_~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_~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;havoc main_~cond~0; 27#L127-1true [2021-07-06 19:03:57,436 INFO L793 eck$LassoCheckResult]: Loop: 27#L127-1true assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 21#L37true 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; 3#L58true assume 0 != main_~p1~0;main_~lk1~0 := 1; 17#L58-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 8#L62-1true assume !(0 != main_~p3~0); 34#L66-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 22#L70-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 28#L74-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 16#L78-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 6#L82-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 30#L86-1true assume !(0 != main_~p1~0); 23#L92-1true assume !(0 != main_~p2~0); 32#L97-1true assume !(0 != main_~p3~0); 5#L102-1true assume !(0 != main_~p4~0); 12#L107-1true assume !(0 != main_~p5~0); 20#L112-1true assume !(0 != main_~p6~0); 10#L117-1true assume !(0 != main_~p7~0); 19#L122-1true assume !(0 != main_~p8~0); 27#L127-1true [2021-07-06 19:03:57,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,440 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-07-06 19:03:57,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947993160] [2021-07-06 19:03:57,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,498 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,506 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,518 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:57,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1098697512, now seen corresponding path program 1 times [2021-07-06 19:03:57,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064226965] [2021-07-06 19:03:57,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,520 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:57,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:57,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:57,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:57,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064226965] [2021-07-06 19:03:57,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064226965] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:57,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:57,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:57,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331976592] [2021-07-06 19:03:57,566 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:57,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:57,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:57,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:57,584 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-07-06 19:03:57,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:57,618 INFO L93 Difference]: Finished difference Result 63 states and 106 transitions. [2021-07-06 19:03:57,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:57,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 106 transitions. [2021-07-06 19:03:57,627 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2021-07-06 19:03:57,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 53 states and 83 transitions. [2021-07-06 19:03:57,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2021-07-06 19:03:57,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2021-07-06 19:03:57,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 83 transitions. [2021-07-06 19:03:57,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:57,631 INFO L681 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2021-07-06 19:03:57,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 83 transitions. [2021-07-06 19:03:57,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-07-06 19:03:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 52 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:03:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2021-07-06 19:03:57,655 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2021-07-06 19:03:57,655 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2021-07-06 19:03:57,655 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 19:03:57,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2021-07-06 19:03:57,656 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2021-07-06 19:03:57,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:57,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:57,656 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:57,656 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:57,657 INFO L791 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 121#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_~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_~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;havoc main_~cond~0; 122#L127-1 [2021-07-06 19:03:57,657 INFO L793 eck$LassoCheckResult]: Loop: 122#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 147#L37 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; 146#L58 assume !(0 != main_~p1~0); 128#L58-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 114#L62-1 assume !(0 != main_~p3~0); 115#L66-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 133#L70-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 134#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 127#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 110#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 111#L86-1 assume !(0 != main_~p1~0); 141#L92-1 assume !(0 != main_~p2~0); 155#L97-1 assume !(0 != main_~p3~0); 154#L102-1 assume !(0 != main_~p4~0); 152#L107-1 assume !(0 != main_~p5~0); 131#L112-1 assume !(0 != main_~p6~0); 124#L117-1 assume !(0 != main_~p7~0); 129#L122-1 assume !(0 != main_~p8~0); 122#L127-1 [2021-07-06 19:03:57,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,657 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-07-06 19:03:57,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782086978] [2021-07-06 19:03:57,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,666 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,671 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,677 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:57,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,677 INFO L82 PathProgramCache]: Analyzing trace with hash 77629158, now seen corresponding path program 1 times [2021-07-06 19:03:57,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549217534] [2021-07-06 19:03:57,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:57,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:57,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:57,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:57,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549217534] [2021-07-06 19:03:57,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549217534] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:57,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:57,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:57,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305687733] [2021-07-06 19:03:57,707 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:57,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:57,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:57,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:57,709 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-07-06 19:03:57,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:57,726 INFO L93 Difference]: Finished difference Result 102 states and 158 transitions. [2021-07-06 19:03:57,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:57,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 158 transitions. [2021-07-06 19:03:57,728 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2021-07-06 19:03:57,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 158 transitions. [2021-07-06 19:03:57,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2021-07-06 19:03:57,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2021-07-06 19:03:57,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 158 transitions. [2021-07-06 19:03:57,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:57,734 INFO L681 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2021-07-06 19:03:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 158 transitions. [2021-07-06 19:03:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-07-06 19:03:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.5490196078431373) internal successors, (158), 101 states have internal predecessors, (158), 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-07-06 19:03:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2021-07-06 19:03:57,744 INFO L704 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2021-07-06 19:03:57,744 INFO L587 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2021-07-06 19:03:57,744 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 19:03:57,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 158 transitions. [2021-07-06 19:03:57,745 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2021-07-06 19:03:57,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:57,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:57,746 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:57,746 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:57,746 INFO L791 eck$LassoCheckResult]: Stem: 304#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 282#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_~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_~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;havoc main_~cond~0; 283#L127-1 [2021-07-06 19:03:57,746 INFO L793 eck$LassoCheckResult]: Loop: 283#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 323#L37 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; 322#L58 assume !(0 != main_~p1~0); 321#L58-2 assume !(0 != main_~p2~0); 275#L62-1 assume !(0 != main_~p3~0); 276#L66-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 295#L70-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 296#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 288#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 289#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 308#L86-1 assume !(0 != main_~p1~0); 309#L92-1 assume !(0 != main_~p2~0); 305#L97-1 assume !(0 != main_~p3~0); 268#L102-1 assume !(0 != main_~p4~0); 270#L107-1 assume !(0 != main_~p5~0); 274#L112-1 assume !(0 != main_~p6~0); 285#L117-1 assume !(0 != main_~p7~0); 359#L122-1 assume !(0 != main_~p8~0); 283#L127-1 [2021-07-06 19:03:57,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,746 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-07-06 19:03:57,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786335215] [2021-07-06 19:03:57,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,753 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,758 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,764 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:57,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1202234520, now seen corresponding path program 1 times [2021-07-06 19:03:57,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812338000] [2021-07-06 19:03:57,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,766 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:57,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:57,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:57,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:57,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812338000] [2021-07-06 19:03:57,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812338000] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:57,781 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:57,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:57,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875611615] [2021-07-06 19:03:57,781 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:57,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:57,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:57,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:57,782 INFO L87 Difference]: Start difference. First operand 102 states and 158 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-07-06 19:03:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:57,792 INFO L93 Difference]: Finished difference Result 198 states and 302 transitions. [2021-07-06 19:03:57,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:57,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 302 transitions. [2021-07-06 19:03:57,794 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2021-07-06 19:03:57,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 302 transitions. [2021-07-06 19:03:57,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2021-07-06 19:03:57,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2021-07-06 19:03:57,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 302 transitions. [2021-07-06 19:03:57,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:57,797 INFO L681 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2021-07-06 19:03:57,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 302 transitions. [2021-07-06 19:03:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-07-06 19:03:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 198 states have (on average 1.5252525252525253) internal successors, (302), 197 states have internal predecessors, (302), 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-07-06 19:03:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 302 transitions. [2021-07-06 19:03:57,805 INFO L704 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2021-07-06 19:03:57,805 INFO L587 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2021-07-06 19:03:57,806 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-07-06 19:03:57,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 302 transitions. [2021-07-06 19:03:57,807 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2021-07-06 19:03:57,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:57,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:57,808 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:57,808 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:57,808 INFO L791 eck$LassoCheckResult]: Stem: 608#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 587#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_~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_~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;havoc main_~cond~0; 588#L127-1 [2021-07-06 19:03:57,808 INFO L793 eck$LassoCheckResult]: Loop: 588#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 673#L37 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; 647#L58 assume !(0 != main_~p1~0); 632#L58-2 assume !(0 != main_~p2~0); 623#L62-1 assume !(0 != main_~p3~0); 624#L66-1 assume !(0 != main_~p4~0); 718#L70-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 745#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 743#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 741#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 737#L86-1 assume !(0 != main_~p1~0); 738#L92-1 assume !(0 != main_~p2~0); 693#L97-1 assume !(0 != main_~p3~0); 690#L102-1 assume !(0 != main_~p4~0); 687#L107-1 assume !(0 != main_~p5~0); 684#L112-1 assume !(0 != main_~p6~0); 683#L117-1 assume !(0 != main_~p7~0); 679#L122-1 assume !(0 != main_~p8~0); 588#L127-1 [2021-07-06 19:03:57,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,809 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-07-06 19:03:57,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107095546] [2021-07-06 19:03:57,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,815 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,819 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,821 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:57,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1789040534, now seen corresponding path program 1 times [2021-07-06 19:03:57,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10816341] [2021-07-06 19:03:57,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:57,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:57,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:57,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:57,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10816341] [2021-07-06 19:03:57,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10816341] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:57,857 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:57,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:57,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899518123] [2021-07-06 19:03:57,857 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:57,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:57,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:57,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:57,858 INFO L87 Difference]: Start difference. First operand 198 states and 302 transitions. cyclomatic complexity: 112 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-07-06 19:03:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:57,869 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2021-07-06 19:03:57,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:57,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 578 transitions. [2021-07-06 19:03:57,871 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2021-07-06 19:03:57,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 386 states and 578 transitions. [2021-07-06 19:03:57,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2021-07-06 19:03:57,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2021-07-06 19:03:57,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 578 transitions. [2021-07-06 19:03:57,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:57,875 INFO L681 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2021-07-06 19:03:57,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 578 transitions. [2021-07-06 19:03:57,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2021-07-06 19:03:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 386 states have (on average 1.4974093264248705) internal successors, (578), 385 states have internal predecessors, (578), 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-07-06 19:03:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 578 transitions. [2021-07-06 19:03:57,885 INFO L704 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2021-07-06 19:03:57,885 INFO L587 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2021-07-06 19:03:57,885 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-07-06 19:03:57,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 578 transitions. [2021-07-06 19:03:57,887 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2021-07-06 19:03:57,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:57,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:57,887 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:57,887 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:57,888 INFO L791 eck$LassoCheckResult]: Stem: 1198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1177#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_~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_~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;havoc main_~cond~0; 1178#L127-1 [2021-07-06 19:03:57,888 INFO L793 eck$LassoCheckResult]: Loop: 1178#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 1253#L37 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; 1248#L58 assume !(0 != main_~p1~0); 1249#L58-2 assume !(0 != main_~p2~0); 1308#L62-1 assume !(0 != main_~p3~0); 1305#L66-1 assume !(0 != main_~p4~0); 1300#L70-1 assume !(0 != main_~p5~0); 1295#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1291#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1287#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1282#L86-1 assume !(0 != main_~p1~0); 1281#L92-1 assume !(0 != main_~p2~0); 1277#L97-1 assume !(0 != main_~p3~0); 1273#L102-1 assume !(0 != main_~p4~0); 1269#L107-1 assume !(0 != main_~p5~0); 1265#L112-1 assume !(0 != main_~p6~0); 1262#L117-1 assume !(0 != main_~p7~0); 1258#L122-1 assume !(0 != main_~p8~0); 1178#L127-1 [2021-07-06 19:03:57,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,888 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-07-06 19:03:57,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089425204] [2021-07-06 19:03:57,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,894 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,898 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,901 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:57,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1530875096, now seen corresponding path program 1 times [2021-07-06 19:03:57,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509538945] [2021-07-06 19:03:57,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:57,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:57,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:57,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:57,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509538945] [2021-07-06 19:03:57,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509538945] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:57,915 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:57,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:57,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000094390] [2021-07-06 19:03:57,916 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:57,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:57,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:57,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:57,916 INFO L87 Difference]: Start difference. First operand 386 states and 578 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-07-06 19:03:57,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:57,927 INFO L93 Difference]: Finished difference Result 754 states and 1106 transitions. [2021-07-06 19:03:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:57,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1106 transitions. [2021-07-06 19:03:57,932 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2021-07-06 19:03:57,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 754 states and 1106 transitions. [2021-07-06 19:03:57,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 754 [2021-07-06 19:03:57,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 754 [2021-07-06 19:03:57,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 754 states and 1106 transitions. [2021-07-06 19:03:57,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:57,939 INFO L681 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2021-07-06 19:03:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states and 1106 transitions. [2021-07-06 19:03:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2021-07-06 19:03:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 754 states have (on average 1.46684350132626) internal successors, (1106), 753 states have internal predecessors, (1106), 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-07-06 19:03:57,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1106 transitions. [2021-07-06 19:03:57,950 INFO L704 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2021-07-06 19:03:57,950 INFO L587 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2021-07-06 19:03:57,951 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-07-06 19:03:57,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 754 states and 1106 transitions. [2021-07-06 19:03:57,953 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2021-07-06 19:03:57,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:57,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:57,957 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:57,958 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:57,958 INFO L791 eck$LassoCheckResult]: Stem: 2344#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2323#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_~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_~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;havoc main_~cond~0; 2324#L127-1 [2021-07-06 19:03:57,958 INFO L793 eck$LassoCheckResult]: Loop: 2324#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 2710#L37 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; 2379#L58 assume !(0 != main_~p1~0); 2380#L58-2 assume !(0 != main_~p2~0); 2673#L62-1 assume !(0 != main_~p3~0); 2672#L66-1 assume !(0 != main_~p4~0); 2670#L70-1 assume !(0 != main_~p5~0); 2669#L74-1 assume !(0 != main_~p6~0); 2668#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2512#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2513#L86-1 assume !(0 != main_~p1~0); 2660#L92-1 assume !(0 != main_~p2~0); 2658#L97-1 assume !(0 != main_~p3~0); 2652#L102-1 assume !(0 != main_~p4~0); 2653#L107-1 assume !(0 != main_~p5~0); 2717#L112-1 assume !(0 != main_~p6~0); 2716#L117-1 assume !(0 != main_~p7~0); 2714#L122-1 assume !(0 != main_~p8~0); 2324#L127-1 [2021-07-06 19:03:57,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,959 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-07-06 19:03:57,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400078931] [2021-07-06 19:03:57,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,965 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,969 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,971 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:57,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,971 INFO L82 PathProgramCache]: Analyzing trace with hash -829810518, now seen corresponding path program 1 times [2021-07-06 19:03:57,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516481545] [2021-07-06 19:03:57,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:57,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:57,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:57,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:57,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516481545] [2021-07-06 19:03:57,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516481545] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:57,985 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:57,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:57,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901877382] [2021-07-06 19:03:57,985 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:57,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:57,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:57,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:57,986 INFO L87 Difference]: Start difference. First operand 754 states and 1106 transitions. cyclomatic complexity: 384 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-07-06 19:03:57,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:57,998 INFO L93 Difference]: Finished difference Result 1474 states and 2114 transitions. [2021-07-06 19:03:57,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:57,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 2114 transitions. [2021-07-06 19:03:58,013 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2021-07-06 19:03:58,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 1474 states and 2114 transitions. [2021-07-06 19:03:58,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1474 [2021-07-06 19:03:58,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1474 [2021-07-06 19:03:58,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1474 states and 2114 transitions. [2021-07-06 19:03:58,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:58,035 INFO L681 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2021-07-06 19:03:58,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states and 2114 transitions. [2021-07-06 19:03:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2021-07-06 19:03:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1474 states have (on average 1.4341926729986432) internal successors, (2114), 1473 states have internal predecessors, (2114), 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-07-06 19:03:58,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2114 transitions. [2021-07-06 19:03:58,053 INFO L704 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2021-07-06 19:03:58,053 INFO L587 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2021-07-06 19:03:58,053 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-07-06 19:03:58,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1474 states and 2114 transitions. [2021-07-06 19:03:58,058 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2021-07-06 19:03:58,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:58,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:58,058 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:58,058 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:58,059 INFO L791 eck$LassoCheckResult]: Stem: 4578#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 4556#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_~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_~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;havoc main_~cond~0; 4557#L127-1 [2021-07-06 19:03:58,059 INFO L793 eck$LassoCheckResult]: Loop: 4557#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 4644#L37 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; 4637#L58 assume !(0 != main_~p1~0); 4629#L58-2 assume !(0 != main_~p2~0); 4624#L62-1 assume !(0 != main_~p3~0); 4617#L66-1 assume !(0 != main_~p4~0); 4614#L70-1 assume !(0 != main_~p5~0); 4603#L74-1 assume !(0 != main_~p6~0); 4604#L78-1 assume !(0 != main_~p7~0); 4711#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4705#L86-1 assume !(0 != main_~p1~0); 4698#L92-1 assume !(0 != main_~p2~0); 4686#L97-1 assume !(0 != main_~p3~0); 4682#L102-1 assume !(0 != main_~p4~0); 4675#L107-1 assume !(0 != main_~p5~0); 4673#L112-1 assume !(0 != main_~p6~0); 4669#L117-1 assume !(0 != main_~p7~0); 4668#L122-1 assume !(0 != main_~p8~0); 4557#L127-1 [2021-07-06 19:03:58,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:58,059 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-07-06 19:03:58,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:58,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656134242] [2021-07-06 19:03:58,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:58,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:58,065 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:58,068 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:58,070 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:58,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:58,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1222837528, now seen corresponding path program 1 times [2021-07-06 19:03:58,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:58,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937736041] [2021-07-06 19:03:58,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:58,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:58,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:58,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:58,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:58,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:58,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:58,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937736041] [2021-07-06 19:03:58,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937736041] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:58,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:58,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-06 19:03:58,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152650854] [2021-07-06 19:03:58,090 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:58,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:58,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:58,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:58,091 INFO L87 Difference]: Start difference. First operand 1474 states and 2114 transitions. cyclomatic complexity: 704 Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-07-06 19:03:58,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:58,118 INFO L93 Difference]: Finished difference Result 2882 states and 4034 transitions. [2021-07-06 19:03:58,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:58,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2882 states and 4034 transitions. [2021-07-06 19:03:58,132 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2021-07-06 19:03:58,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2882 states to 2882 states and 4034 transitions. [2021-07-06 19:03:58,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2882 [2021-07-06 19:03:58,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2882 [2021-07-06 19:03:58,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2882 states and 4034 transitions. [2021-07-06 19:03:58,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:58,146 INFO L681 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2021-07-06 19:03:58,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states and 4034 transitions. [2021-07-06 19:03:58,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2021-07-06 19:03:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2882 states, 2882 states have (on average 1.3997224149895906) internal successors, (4034), 2881 states have internal predecessors, (4034), 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-07-06 19:03:58,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4034 transitions. [2021-07-06 19:03:58,179 INFO L704 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2021-07-06 19:03:58,179 INFO L587 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2021-07-06 19:03:58,180 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-07-06 19:03:58,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2882 states and 4034 transitions. [2021-07-06 19:03:58,195 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2021-07-06 19:03:58,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:58,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:58,196 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:58,196 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:58,196 INFO L791 eck$LassoCheckResult]: Stem: 8942#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 8918#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_~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_~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;havoc main_~cond~0; 8919#L127-1 [2021-07-06 19:03:58,196 INFO L793 eck$LassoCheckResult]: Loop: 8919#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 9020#L37 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; 9015#L58 assume !(0 != main_~p1~0); 9007#L58-2 assume !(0 != main_~p2~0); 9000#L62-1 assume !(0 != main_~p3~0); 8995#L66-1 assume !(0 != main_~p4~0); 8987#L70-1 assume !(0 != main_~p5~0); 8988#L74-1 assume !(0 != main_~p6~0); 9069#L78-1 assume !(0 != main_~p7~0); 9065#L82-1 assume !(0 != main_~p8~0); 9061#L86-1 assume !(0 != main_~p1~0); 9057#L92-1 assume !(0 != main_~p2~0); 9053#L97-1 assume !(0 != main_~p3~0); 9049#L102-1 assume !(0 != main_~p4~0); 9047#L107-1 assume !(0 != main_~p5~0); 9040#L112-1 assume !(0 != main_~p6~0); 9035#L117-1 assume !(0 != main_~p7~0); 9030#L122-1 assume !(0 != main_~p8~0); 8919#L127-1 [2021-07-06 19:03:58,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:58,196 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-07-06 19:03:58,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:58,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856607531] [2021-07-06 19:03:58,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:58,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:58,207 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:58,218 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:58,223 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:58,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:58,228 INFO L82 PathProgramCache]: Analyzing trace with hash -542779158, now seen corresponding path program 1 times [2021-07-06 19:03:58,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:58,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167841337] [2021-07-06 19:03:58,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:58,228 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:58,232 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:58,235 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:58,238 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:58,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1175900116, now seen corresponding path program 1 times [2021-07-06 19:03:58,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:58,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835377620] [2021-07-06 19:03:58,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:58,241 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:58,249 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:58,252 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:58,254 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:58,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:58,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-07-06 19:03:58,532 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2021-07-06 19:03:58,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:58,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2021-07-06 19:03:58,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 07:03:58 BoogieIcfgContainer [2021-07-06 19:03:58,607 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 19:03:58,607 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 19:03:58,607 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 19:03:58,607 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 19:03:58,608 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 07:03:57" (3/4) ... [2021-07-06 19:03:58,609 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 19:03:58,635 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 19:03:58,635 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 19:03:58,636 INFO L168 Benchmark]: Toolchain (without parser) took 1910.39 ms. Allocated memory was 54.5 MB in the beginning and 100.7 MB in the end (delta: 46.1 MB). Free memory was 32.4 MB in the beginning and 74.8 MB in the end (delta: -42.4 MB). Peak memory consumption was 36.6 MB. Max. memory is 16.1 GB. [2021-07-06 19:03:58,636 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 54.5 MB. Free memory was 37.6 MB in the beginning and 37.6 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 19:03:58,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.41 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 32.2 MB in the beginning and 53.0 MB in the end (delta: -20.8 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.1 GB. [2021-07-06 19:03:58,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.37 ms. Allocated memory is still 69.2 MB. Free memory was 53.0 MB in the beginning and 51.5 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 19:03:58,637 INFO L168 Benchmark]: Boogie Preprocessor took 33.71 ms. Allocated memory is still 69.2 MB. Free memory was 51.5 MB in the beginning and 50.2 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 19:03:58,637 INFO L168 Benchmark]: RCFGBuilder took 370.18 ms. Allocated memory is still 69.2 MB. Free memory was 50.2 MB in the beginning and 32.4 MB in the end (delta: 17.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-07-06 19:03:58,638 INFO L168 Benchmark]: BuchiAutomizer took 1257.43 ms. Allocated memory was 69.2 MB in the beginning and 83.9 MB in the end (delta: 14.7 MB). Free memory was 32.4 MB in the beginning and 28.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 27.1 MB. Max. memory is 16.1 GB. [2021-07-06 19:03:58,638 INFO L168 Benchmark]: Witness Printer took 28.29 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 28.6 MB in the beginning and 74.8 MB in the end (delta: -46.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 19:03:58,639 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.14 ms. Allocated memory is still 54.5 MB. Free memory was 37.6 MB in the beginning and 37.6 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 177.41 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 32.2 MB in the beginning and 53.0 MB in the end (delta: -20.8 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 33.37 ms. Allocated memory is still 69.2 MB. Free memory was 53.0 MB in the beginning and 51.5 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.71 ms. Allocated memory is still 69.2 MB. Free memory was 51.5 MB in the beginning and 50.2 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 370.18 ms. Allocated memory is still 69.2 MB. Free memory was 50.2 MB in the beginning and 32.4 MB in the end (delta: 17.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 1257.43 ms. Allocated memory was 69.2 MB in the beginning and 83.9 MB in the end (delta: 14.7 MB). Free memory was 32.4 MB in the beginning and 28.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 27.1 MB. Max. memory is 16.1 GB. * Witness Printer took 28.29 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 28.6 MB in the beginning and 74.8 MB in the end (delta: -46.2 MB). Peak memory consumption was 2.1 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 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2882 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.2s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 106.2ms AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 2882 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 459 SDtfs, 236 SDslu, 277 SDs, 0 SdLazy, 35 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 45.0ms Time LassoAnalysisResults: nont1 unkn0 SFLI7 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: 35]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=6389} State at position 1 is {NULL=6390, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=6389, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18f536ac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11c30a55=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4cc494a0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ee6613c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f176a1a=0, cond=9, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@568f520f=0, NULL=6391, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e06adea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6334d497=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7972551=9, NULL=0, NULL=0, NULL=0, NULL=6392, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0, lk7=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 35]: 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; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 19:03:58,683 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...