./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_15-1.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_15-1.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 04dfa849b43716e8587b0fc4953cadbe3968c4e3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:48,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 19:03:48,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 19:03:48,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 19:03:48,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 19:03:48,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 19:03:48,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 19:03:48,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 19:03:48,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 19:03:48,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 19:03:48,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 19:03:48,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 19:03:48,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 19:03:48,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 19:03:48,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 19:03:48,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 19:03:48,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 19:03:48,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 19:03:48,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 19:03:48,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 19:03:48,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 19:03:48,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 19:03:48,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 19:03:48,871 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 19:03:48,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 19:03:48,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 19:03:48,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 19:03:48,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 19:03:48,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 19:03:48,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 19:03:48,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 19:03:48,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 19:03:48,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 19:03:48,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 19:03:48,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 19:03:48,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 19:03:48,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 19:03:48,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 19:03:48,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 19:03:48,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 19:03:48,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 19:03:48,908 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:48,959 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 19:03:48,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 19:03:48,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 19:03:48,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 19:03:48,970 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 19:03:48,971 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 19:03:48,971 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 19:03:48,971 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 19:03:48,971 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 19:03:48,972 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 19:03:48,972 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 19:03:48,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 19:03:48,973 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 19:03:48,973 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 19:03:48,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 19:03:48,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 19:03:48,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 19:03:48,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 19:03:48,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 19:03:48,985 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 19:03:48,986 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 19:03:48,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 19:03:48,986 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 19:03:48,986 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 19:03:48,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 19:03:48,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 19:03:48,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 19:03:48,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 19:03:48,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 19:03:48,988 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 19:03:48,989 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 19:03:49,004 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 -> 04dfa849b43716e8587b0fc4953cadbe3968c4e3 [2021-07-06 19:03:49,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 19:03:49,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 19:03:49,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 19:03:49,654 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 19:03:49,654 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 19:03:49,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2021-07-06 19:03:49,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2560b2581/73f42b47a196476a8551a265ac033832/FLAG386bbb1f3 [2021-07-06 19:03:50,178 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 19:03:50,182 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2021-07-06 19:03:50,191 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2560b2581/73f42b47a196476a8551a265ac033832/FLAG386bbb1f3 [2021-07-06 19:03:50,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2560b2581/73f42b47a196476a8551a265ac033832 [2021-07-06 19:03:50,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 19:03:50,592 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 19:03:50,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 19:03:50,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 19:03:50,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 19:03:50,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 07:03:50" (1/1) ... [2021-07-06 19:03:50,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a60a7fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:50, skipping insertion in model container [2021-07-06 19:03:50,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 07:03:50" (1/1) ... [2021-07-06 19:03:50,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 19:03:50,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 19:03:50,763 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_15-1.c[5654,5667] [2021-07-06 19:03:50,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 19:03:50,772 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 19:03:50,795 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_15-1.c[5654,5667] [2021-07-06 19:03:50,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 19:03:50,843 INFO L208 MainTranslator]: Completed translation [2021-07-06 19:03:50,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:50 WrapperNode [2021-07-06 19:03:50,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 19:03:50,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 19:03:50,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 19:03:50,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 19:03:50,855 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:50" (1/1) ... [2021-07-06 19:03:50,869 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:50" (1/1) ... [2021-07-06 19:03:50,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 19:03:50,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 19:03:50,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 19:03:50,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 19:03:50,903 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:50" (1/1) ... [2021-07-06 19:03:50,903 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:50" (1/1) ... [2021-07-06 19:03:50,914 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:50" (1/1) ... [2021-07-06 19:03:50,914 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:50" (1/1) ... [2021-07-06 19:03:50,922 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:50" (1/1) ... [2021-07-06 19:03:50,933 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:50" (1/1) ... [2021-07-06 19:03:50,936 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:50" (1/1) ... [2021-07-06 19:03:50,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 19:03:50,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 19:03:50,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 19:03:50,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 19:03:50,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:50" (1/1) ... [2021-07-06 19:03:50,950 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 19:03:50,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 19:03:50,974 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:50,993 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:51,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 19:03:51,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 19:03:51,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 19:03:51,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 19:03:51,368 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 19:03:51,370 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-07-06 19:03:51,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 07:03:51 BoogieIcfgContainer [2021-07-06 19:03:51,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 19:03:51,372 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 19:03:51,372 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 19:03:51,374 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 19:03:51,375 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 19:03:51,375 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 07:03:50" (1/3) ... [2021-07-06 19:03:51,376 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48446a06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 07:03:51, skipping insertion in model container [2021-07-06 19:03:51,392 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 19:03:51,392 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:50" (2/3) ... [2021-07-06 19:03:51,393 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48446a06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 07:03:51, skipping insertion in model container [2021-07-06 19:03:51,393 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 19:03:51,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 07:03:51" (3/3) ... [2021-07-06 19:03:51,394 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_15-1.c [2021-07-06 19:03:51,461 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 19:03:51,461 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 19:03:51,461 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 19:03:51,462 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 19:03:51,462 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 19:03:51,462 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 19:03:51,462 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 19:03:51,462 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 19:03:51,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 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:51,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-07-06 19:03:51,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:51,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:51,508 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:51,508 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:51,508 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 19:03:51,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 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:51,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-07-06 19:03:51,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:51,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:51,519 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:51,520 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:51,525 INFO L791 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 9#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 51#L225-1true [2021-07-06 19:03:51,528 INFO L793 eck$LassoCheckResult]: Loop: 51#L225-1true assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 3#L58true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 35#L93true assume 0 != main_~p1~0;main_~lk1~0 := 1; 32#L93-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 52#L97-1true assume !(0 != main_~p3~0); 55#L101-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 47#L105-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 14#L109-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 5#L113-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 8#L117-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 28#L121-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 20#L125-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 40#L129-1true assume !(0 != main_~p11~0); 43#L133-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 37#L137-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 53#L141-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 44#L145-1true assume 0 != main_~p15~0;main_~lk15~0 := 1; 49#L149-1true assume !(0 != main_~p1~0); 31#L155-1true assume 0 != main_~p2~0; 26#L161true assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 10#L160true assume !(0 != main_~p3~0); 30#L165-1true assume !(0 != main_~p4~0); 38#L170-1true assume !(0 != main_~p5~0); 18#L175-1true assume !(0 != main_~p6~0); 23#L180-1true assume !(0 != main_~p7~0); 54#L185-1true assume !(0 != main_~p8~0); 6#L190-1true assume !(0 != main_~p9~0); 41#L195-1true assume !(0 != main_~p10~0); 46#L200-1true assume !(0 != main_~p11~0); 27#L205-1true assume !(0 != main_~p12~0); 34#L210-1true assume !(0 != main_~p13~0); 12#L215-1true assume 0 != main_~p14~0; 36#L221true assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 21#L220true assume !(0 != main_~p15~0); 51#L225-1true [2021-07-06 19:03:51,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:51,540 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-07-06 19:03:51,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:51,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584881376] [2021-07-06 19:03:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:51,549 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:51,654 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:51,690 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:51,711 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:51,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:51,713 INFO L82 PathProgramCache]: Analyzing trace with hash -638858682, now seen corresponding path program 1 times [2021-07-06 19:03:51,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:51,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894847215] [2021-07-06 19:03:51,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:51,716 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:51,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:51,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:51,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:51,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:51,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:51,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:51,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:51,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894847215] [2021-07-06 19:03:51,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894847215] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:51,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:51,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:51,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372314886] [2021-07-06 19:03:51,852 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:51,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:51,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:51,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:51,875 INFO L87 Difference]: Start difference. First operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 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 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:51,937 INFO L93 Difference]: Finished difference Result 105 states and 190 transitions. [2021-07-06 19:03:51,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:51,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 190 transitions. [2021-07-06 19:03:51,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-07-06 19:03:51,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 95 states and 149 transitions. [2021-07-06 19:03:51,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2021-07-06 19:03:51,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2021-07-06 19:03:51,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 149 transitions. [2021-07-06 19:03:51,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:51,958 INFO L681 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2021-07-06 19:03:51,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 149 transitions. [2021-07-06 19:03:51,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-07-06 19:03:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.568421052631579) internal successors, (149), 94 states have internal predecessors, (149), 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:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2021-07-06 19:03:51,994 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2021-07-06 19:03:51,994 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2021-07-06 19:03:51,994 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 19:03:51,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 149 transitions. [2021-07-06 19:03:52,001 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-07-06 19:03:52,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:52,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:52,003 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:52,003 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:52,003 INFO L791 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 180#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 181#L225-1 [2021-07-06 19:03:52,004 INFO L793 eck$LassoCheckResult]: Loop: 181#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 170#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 171#L93 assume !(0 != main_~p1~0); 225#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 223#L97-1 assume !(0 != main_~p3~0); 224#L101-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 221#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 189#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 172#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 173#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 179#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 197#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 198#L129-1 assume !(0 != main_~p11~0); 214#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 211#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 212#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 218#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 219#L149-1 assume !(0 != main_~p1~0); 228#L155-1 assume 0 != main_~p2~0; 262#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 261#L160 assume !(0 != main_~p3~0); 259#L165-1 assume !(0 != main_~p4~0); 256#L170-1 assume !(0 != main_~p5~0); 255#L175-1 assume !(0 != main_~p6~0); 253#L180-1 assume !(0 != main_~p7~0); 250#L185-1 assume !(0 != main_~p8~0); 249#L190-1 assume !(0 != main_~p9~0); 215#L195-1 assume !(0 != main_~p10~0); 178#L200-1 assume !(0 != main_~p11~0); 217#L205-1 assume !(0 != main_~p12~0); 208#L210-1 assume !(0 != main_~p13~0); 187#L215-1 assume 0 != main_~p14~0; 188#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 209#L220 assume !(0 != main_~p15~0); 181#L225-1 [2021-07-06 19:03:52,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:52,004 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-07-06 19:03:52,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:52,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296903669] [2021-07-06 19:03:52,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:52,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:52,028 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:52,041 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:52,049 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:52,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:52,050 INFO L82 PathProgramCache]: Analyzing trace with hash -364099068, now seen corresponding path program 1 times [2021-07-06 19:03:52,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:52,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020442081] [2021-07-06 19:03:52,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:52,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:52,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:52,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:52,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:52,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:52,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:52,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:52,100 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:52,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:52,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020442081] [2021-07-06 19:03:52,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020442081] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:52,101 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:52,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:52,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390156015] [2021-07-06 19:03:52,102 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:52,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:52,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:52,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:52,103 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:52,119 INFO L93 Difference]: Finished difference Result 186 states and 290 transitions. [2021-07-06 19:03:52,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:52,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 290 transitions. [2021-07-06 19:03:52,122 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2021-07-06 19:03:52,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 290 transitions. [2021-07-06 19:03:52,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2021-07-06 19:03:52,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2021-07-06 19:03:52,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 290 transitions. [2021-07-06 19:03:52,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:52,126 INFO L681 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2021-07-06 19:03:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 290 transitions. [2021-07-06 19:03:52,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-07-06 19:03:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.5591397849462365) internal successors, (290), 185 states have internal predecessors, (290), 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:52,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2021-07-06 19:03:52,136 INFO L704 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2021-07-06 19:03:52,136 INFO L587 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2021-07-06 19:03:52,136 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 19:03:52,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 290 transitions. [2021-07-06 19:03:52,137 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2021-07-06 19:03:52,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:52,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:52,138 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:52,138 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:52,138 INFO L791 eck$LassoCheckResult]: Stem: 486#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 467#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 468#L225-1 [2021-07-06 19:03:52,139 INFO L793 eck$LassoCheckResult]: Loop: 468#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 557#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 554#L93 assume !(0 != main_~p1~0); 551#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 509#L97-1 assume !(0 != main_~p3~0); 510#L101-1 assume !(0 != main_~p4~0); 547#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 636#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 635#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 634#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 631#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 628#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 625#L129-1 assume !(0 != main_~p11~0); 624#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 623#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 622#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 620#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 619#L149-1 assume !(0 != main_~p1~0); 492#L155-1 assume 0 != main_~p2~0; 493#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 519#L160 assume !(0 != main_~p3~0); 515#L165-1 assume !(0 != main_~p4~0); 516#L170-1 assume !(0 != main_~p5~0); 618#L175-1 assume !(0 != main_~p6~0); 616#L180-1 assume !(0 != main_~p7~0); 613#L185-1 assume !(0 != main_~p8~0); 612#L190-1 assume !(0 != main_~p9~0); 589#L195-1 assume !(0 != main_~p10~0); 587#L200-1 assume !(0 != main_~p11~0); 585#L205-1 assume !(0 != main_~p12~0); 574#L210-1 assume !(0 != main_~p13~0); 570#L215-1 assume 0 != main_~p14~0; 568#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 564#L220 assume !(0 != main_~p15~0); 468#L225-1 [2021-07-06 19:03:52,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:52,139 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-07-06 19:03:52,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:52,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786104968] [2021-07-06 19:03:52,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:52,140 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:52,148 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:52,153 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:52,157 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:52,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:52,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1022104326, now seen corresponding path program 1 times [2021-07-06 19:03:52,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:52,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841187992] [2021-07-06 19:03:52,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:52,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:52,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:52,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:52,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:52,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:52,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:52,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:52,181 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:52,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:52,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841187992] [2021-07-06 19:03:52,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841187992] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:52,182 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:52,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:52,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629285681] [2021-07-06 19:03:52,183 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:52,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:52,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:52,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:52,184 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. cyclomatic complexity: 108 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:52,207 INFO L93 Difference]: Finished difference Result 366 states and 566 transitions. [2021-07-06 19:03:52,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:52,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 566 transitions. [2021-07-06 19:03:52,211 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2021-07-06 19:03:52,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 566 transitions. [2021-07-06 19:03:52,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2021-07-06 19:03:52,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2021-07-06 19:03:52,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 566 transitions. [2021-07-06 19:03:52,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:52,216 INFO L681 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2021-07-06 19:03:52,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 566 transitions. [2021-07-06 19:03:52,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-07-06 19:03:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.546448087431694) internal successors, (566), 365 states have internal predecessors, (566), 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:52,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 566 transitions. [2021-07-06 19:03:52,244 INFO L704 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2021-07-06 19:03:52,244 INFO L587 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2021-07-06 19:03:52,244 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-07-06 19:03:52,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 566 transitions. [2021-07-06 19:03:52,247 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2021-07-06 19:03:52,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:52,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:52,247 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:52,247 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:52,248 INFO L791 eck$LassoCheckResult]: Stem: 1045#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1025#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 1026#L225-1 [2021-07-06 19:03:52,248 INFO L793 eck$LassoCheckResult]: Loop: 1026#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 1136#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 1134#L93 assume !(0 != main_~p1~0); 1132#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 1130#L97-1 assume !(0 != main_~p3~0); 1110#L101-1 assume !(0 != main_~p4~0); 1111#L105-1 assume !(0 != main_~p5~0); 1315#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1313#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1311#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1309#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1307#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1305#L129-1 assume !(0 != main_~p11~0); 1303#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1301#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1299#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1297#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 1295#L149-1 assume !(0 != main_~p1~0); 1293#L155-1 assume 0 != main_~p2~0; 1288#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 1270#L160 assume !(0 != main_~p3~0); 1263#L165-1 assume !(0 != main_~p4~0); 1264#L170-1 assume !(0 != main_~p5~0); 1330#L175-1 assume !(0 != main_~p6~0); 1327#L180-1 assume !(0 != main_~p7~0); 1323#L185-1 assume !(0 != main_~p8~0); 1322#L190-1 assume !(0 != main_~p9~0); 1319#L195-1 assume !(0 != main_~p10~0); 1196#L200-1 assume !(0 != main_~p11~0); 1150#L205-1 assume !(0 != main_~p12~0); 1147#L210-1 assume !(0 != main_~p13~0); 1145#L215-1 assume 0 != main_~p14~0; 1143#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 1140#L220 assume !(0 != main_~p15~0); 1026#L225-1 [2021-07-06 19:03:52,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:52,249 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-07-06 19:03:52,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:52,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010111934] [2021-07-06 19:03:52,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:52,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:52,257 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:52,262 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:52,265 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:52,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:52,266 INFO L82 PathProgramCache]: Analyzing trace with hash 512631236, now seen corresponding path program 1 times [2021-07-06 19:03:52,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:52,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144525023] [2021-07-06 19:03:52,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:52,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:52,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:52,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:52,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:52,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:52,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:52,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:52,288 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:52,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:52,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144525023] [2021-07-06 19:03:52,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144525023] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:52,288 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:52,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:52,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682565163] [2021-07-06 19:03:52,289 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:52,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:52,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:52,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:52,290 INFO L87 Difference]: Start difference. First operand 366 states and 566 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:52,306 INFO L93 Difference]: Finished difference Result 722 states and 1106 transitions. [2021-07-06 19:03:52,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:52,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1106 transitions. [2021-07-06 19:03:52,323 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2021-07-06 19:03:52,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1106 transitions. [2021-07-06 19:03:52,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2021-07-06 19:03:52,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2021-07-06 19:03:52,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1106 transitions. [2021-07-06 19:03:52,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:52,331 INFO L681 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2021-07-06 19:03:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1106 transitions. [2021-07-06 19:03:52,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2021-07-06 19:03:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 722 states have (on average 1.5318559556786704) internal successors, (1106), 721 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:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1106 transitions. [2021-07-06 19:03:52,347 INFO L704 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2021-07-06 19:03:52,348 INFO L587 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2021-07-06 19:03:52,348 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-07-06 19:03:52,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1106 transitions. [2021-07-06 19:03:52,351 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2021-07-06 19:03:52,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:52,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:52,352 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:52,352 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:52,353 INFO L791 eck$LassoCheckResult]: Stem: 2139#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2119#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 2120#L225-1 [2021-07-06 19:03:52,353 INFO L793 eck$LassoCheckResult]: Loop: 2120#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 2301#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 2298#L93 assume !(0 != main_~p1~0); 2296#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 2294#L97-1 assume !(0 != main_~p3~0); 2229#L101-1 assume !(0 != main_~p4~0); 2230#L105-1 assume !(0 != main_~p5~0); 2377#L109-1 assume !(0 != main_~p6~0); 2375#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2373#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2370#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2368#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2366#L129-1 assume !(0 != main_~p11~0); 2364#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2363#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2361#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2359#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 2356#L149-1 assume !(0 != main_~p1~0); 2353#L155-1 assume 0 != main_~p2~0; 2350#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 2347#L160 assume !(0 != main_~p3~0); 2342#L165-1 assume !(0 != main_~p4~0); 2338#L170-1 assume !(0 != main_~p5~0); 2334#L175-1 assume !(0 != main_~p6~0); 2331#L180-1 assume !(0 != main_~p7~0); 2327#L185-1 assume !(0 != main_~p8~0); 2325#L190-1 assume !(0 != main_~p9~0); 2321#L195-1 assume !(0 != main_~p10~0); 2318#L200-1 assume !(0 != main_~p11~0); 2315#L205-1 assume !(0 != main_~p12~0); 2312#L210-1 assume !(0 != main_~p13~0); 2310#L215-1 assume 0 != main_~p14~0; 2308#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 2305#L220 assume !(0 != main_~p15~0); 2120#L225-1 [2021-07-06 19:03:52,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:52,353 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-07-06 19:03:52,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:52,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891310657] [2021-07-06 19:03:52,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:52,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:52,361 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:52,366 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:52,369 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:52,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:52,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1859108026, now seen corresponding path program 1 times [2021-07-06 19:03:52,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:52,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336254149] [2021-07-06 19:03:52,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:52,370 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:52,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:52,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:52,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:52,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:52,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:52,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:52,390 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:52,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:52,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336254149] [2021-07-06 19:03:52,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336254149] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:52,391 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:52,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:52,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822869924] [2021-07-06 19:03:52,392 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:52,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:52,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:52,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:52,393 INFO L87 Difference]: Start difference. First operand 722 states and 1106 transitions. cyclomatic complexity: 400 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:52,417 INFO L93 Difference]: Finished difference Result 1426 states and 2162 transitions. [2021-07-06 19:03:52,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:52,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2162 transitions. [2021-07-06 19:03:52,429 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2021-07-06 19:03:52,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2162 transitions. [2021-07-06 19:03:52,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2021-07-06 19:03:52,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2021-07-06 19:03:52,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2162 transitions. [2021-07-06 19:03:52,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:52,440 INFO L681 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2021-07-06 19:03:52,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2162 transitions. [2021-07-06 19:03:52,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2021-07-06 19:03:52,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1426 states have (on average 1.5161290322580645) internal successors, (2162), 1425 states have internal predecessors, (2162), 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:52,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2162 transitions. [2021-07-06 19:03:52,470 INFO L704 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2021-07-06 19:03:52,470 INFO L587 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2021-07-06 19:03:52,471 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-07-06 19:03:52,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2162 transitions. [2021-07-06 19:03:52,477 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2021-07-06 19:03:52,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:52,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:52,478 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:52,478 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:52,479 INFO L791 eck$LassoCheckResult]: Stem: 4294#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 4274#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 4275#L225-1 [2021-07-06 19:03:52,479 INFO L793 eck$LassoCheckResult]: Loop: 4275#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 4708#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 4700#L93 assume !(0 != main_~p1~0); 4701#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 4689#L97-1 assume !(0 != main_~p3~0); 4690#L101-1 assume !(0 != main_~p4~0); 4679#L105-1 assume !(0 != main_~p5~0); 4681#L109-1 assume !(0 != main_~p6~0); 4775#L113-1 assume !(0 != main_~p7~0); 4774#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4773#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4772#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4771#L129-1 assume !(0 != main_~p11~0); 4770#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4769#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4768#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4767#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 4765#L149-1 assume !(0 != main_~p1~0); 4764#L155-1 assume 0 != main_~p2~0; 4763#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 4761#L160 assume !(0 != main_~p3~0); 4588#L165-1 assume !(0 != main_~p4~0); 4589#L170-1 assume !(0 != main_~p5~0); 4573#L175-1 assume !(0 != main_~p6~0); 4575#L180-1 assume !(0 != main_~p7~0); 4758#L185-1 assume !(0 != main_~p8~0); 4748#L190-1 assume !(0 != main_~p9~0); 4747#L195-1 assume !(0 != main_~p10~0); 4738#L200-1 assume !(0 != main_~p11~0); 4737#L205-1 assume !(0 != main_~p12~0); 4727#L210-1 assume !(0 != main_~p13~0); 4726#L215-1 assume 0 != main_~p14~0; 4716#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 4717#L220 assume !(0 != main_~p15~0); 4275#L225-1 [2021-07-06 19:03:52,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:52,480 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-07-06 19:03:52,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:52,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189462488] [2021-07-06 19:03:52,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:52,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:52,487 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:52,491 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:52,494 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:52,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1797068412, now seen corresponding path program 1 times [2021-07-06 19:03:52,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:52,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063301142] [2021-07-06 19:03:52,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:52,495 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:52,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:52,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:52,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:52,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:52,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:52,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:52,531 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:52,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:52,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063301142] [2021-07-06 19:03:52,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063301142] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:52,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:52,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:52,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497915354] [2021-07-06 19:03:52,532 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:52,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:52,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:52,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:52,533 INFO L87 Difference]: Start difference. First operand 1426 states and 2162 transitions. cyclomatic complexity: 768 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:52,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:52,555 INFO L93 Difference]: Finished difference Result 2818 states and 4226 transitions. [2021-07-06 19:03:52,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:52,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4226 transitions. [2021-07-06 19:03:52,576 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2021-07-06 19:03:52,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4226 transitions. [2021-07-06 19:03:52,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2021-07-06 19:03:52,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2021-07-06 19:03:52,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4226 transitions. [2021-07-06 19:03:52,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:52,598 INFO L681 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2021-07-06 19:03:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4226 transitions. [2021-07-06 19:03:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2021-07-06 19:03:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2818 states have (on average 1.4996451383960256) internal successors, (4226), 2817 states have internal predecessors, (4226), 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:52,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4226 transitions. [2021-07-06 19:03:52,659 INFO L704 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2021-07-06 19:03:52,659 INFO L587 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2021-07-06 19:03:52,659 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-07-06 19:03:52,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4226 transitions. [2021-07-06 19:03:52,678 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2021-07-06 19:03:52,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:52,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:52,690 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:52,691 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:52,691 INFO L791 eck$LassoCheckResult]: Stem: 8543#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 8524#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 8525#L225-1 [2021-07-06 19:03:52,691 INFO L793 eck$LassoCheckResult]: Loop: 8525#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 8893#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 8889#L93 assume !(0 != main_~p1~0); 8886#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 8884#L97-1 assume !(0 != main_~p3~0); 8675#L101-1 assume !(0 != main_~p4~0); 8676#L105-1 assume !(0 != main_~p5~0); 9045#L109-1 assume !(0 != main_~p6~0); 9040#L113-1 assume !(0 != main_~p7~0); 9033#L117-1 assume !(0 != main_~p8~0); 9026#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 9020#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 9014#L129-1 assume !(0 != main_~p11~0); 8994#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8992#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8990#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8987#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 8958#L149-1 assume !(0 != main_~p1~0); 8956#L155-1 assume 0 != main_~p2~0; 8955#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 8954#L160 assume !(0 != main_~p3~0); 8940#L165-1 assume !(0 != main_~p4~0); 8941#L170-1 assume !(0 != main_~p5~0); 8951#L175-1 assume !(0 != main_~p6~0); 8943#L180-1 assume !(0 != main_~p7~0); 8934#L185-1 assume !(0 != main_~p8~0); 8929#L190-1 assume !(0 != main_~p9~0); 8922#L195-1 assume !(0 != main_~p10~0); 8915#L200-1 assume !(0 != main_~p11~0); 8911#L205-1 assume !(0 != main_~p12~0); 8908#L210-1 assume !(0 != main_~p13~0); 8905#L215-1 assume 0 != main_~p14~0; 8902#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 8899#L220 assume !(0 != main_~p15~0); 8525#L225-1 [2021-07-06 19:03:52,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:52,692 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-07-06 19:03:52,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:52,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408191645] [2021-07-06 19:03:52,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:52,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:52,708 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:52,722 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:52,730 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:52,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:52,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1656519802, now seen corresponding path program 1 times [2021-07-06 19:03:52,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:52,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037687229] [2021-07-06 19:03:52,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:52,731 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:52,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:52,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:52,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:52,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:52,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:52,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:52,776 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:52,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:52,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037687229] [2021-07-06 19:03:52,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037687229] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:52,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:52,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:52,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332746619] [2021-07-06 19:03:52,778 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:52,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:52,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:52,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:52,779 INFO L87 Difference]: Start difference. First operand 2818 states and 4226 transitions. cyclomatic complexity: 1472 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:52,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:52,828 INFO L93 Difference]: Finished difference Result 5570 states and 8258 transitions. [2021-07-06 19:03:52,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:52,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8258 transitions. [2021-07-06 19:03:52,881 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2021-07-06 19:03:52,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8258 transitions. [2021-07-06 19:03:52,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2021-07-06 19:03:52,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2021-07-06 19:03:52,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8258 transitions. [2021-07-06 19:03:52,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:52,980 INFO L681 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2021-07-06 19:03:52,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8258 transitions. [2021-07-06 19:03:53,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2021-07-06 19:03:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5570 states have (on average 1.4825852782764812) internal successors, (8258), 5569 states have internal predecessors, (8258), 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:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8258 transitions. [2021-07-06 19:03:53,088 INFO L704 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2021-07-06 19:03:53,088 INFO L587 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2021-07-06 19:03:53,088 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-07-06 19:03:53,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8258 transitions. [2021-07-06 19:03:53,175 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2021-07-06 19:03:53,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:53,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:53,176 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:53,176 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:53,176 INFO L791 eck$LassoCheckResult]: Stem: 16937#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 16916#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 16917#L225-1 [2021-07-06 19:03:53,176 INFO L793 eck$LassoCheckResult]: Loop: 16917#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 17066#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 17064#L93 assume !(0 != main_~p1~0); 17062#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 17060#L97-1 assume !(0 != main_~p3~0); 17056#L101-1 assume !(0 != main_~p4~0); 17052#L105-1 assume !(0 != main_~p5~0); 17048#L109-1 assume !(0 != main_~p6~0); 17044#L113-1 assume !(0 != main_~p7~0); 17040#L117-1 assume !(0 != main_~p8~0); 17036#L121-1 assume !(0 != main_~p9~0); 17034#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 17032#L129-1 assume !(0 != main_~p11~0); 17030#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 17028#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 17026#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 17024#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 17022#L149-1 assume !(0 != main_~p1~0); 17016#L155-1 assume 0 != main_~p2~0; 17017#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 17008#L160 assume !(0 != main_~p3~0); 17007#L165-1 assume !(0 != main_~p4~0); 17109#L170-1 assume !(0 != main_~p5~0); 17105#L175-1 assume !(0 != main_~p6~0); 17101#L180-1 assume !(0 != main_~p7~0); 17097#L185-1 assume !(0 != main_~p8~0); 17093#L190-1 assume !(0 != main_~p9~0); 17090#L195-1 assume !(0 != main_~p10~0); 17086#L200-1 assume !(0 != main_~p11~0); 17082#L205-1 assume !(0 != main_~p12~0); 17078#L210-1 assume !(0 != main_~p13~0); 17075#L215-1 assume 0 != main_~p14~0; 17073#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 17070#L220 assume !(0 != main_~p15~0); 16917#L225-1 [2021-07-06 19:03:53,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:53,177 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-07-06 19:03:53,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:53,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820508450] [2021-07-06 19:03:53,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:53,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:53,204 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:53,211 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:53,214 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:53,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:53,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1790533308, now seen corresponding path program 1 times [2021-07-06 19:03:53,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:53,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690641362] [2021-07-06 19:03:53,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:53,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:53,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:53,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:53,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:53,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:53,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:53,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:53,247 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:53,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:53,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690641362] [2021-07-06 19:03:53,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690641362] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:53,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:53,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:53,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464131273] [2021-07-06 19:03:53,249 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:53,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:53,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:53,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:53,250 INFO L87 Difference]: Start difference. First operand 5570 states and 8258 transitions. cyclomatic complexity: 2816 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:53,301 INFO L93 Difference]: Finished difference Result 11010 states and 16130 transitions. [2021-07-06 19:03:53,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:53,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16130 transitions. [2021-07-06 19:03:53,402 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2021-07-06 19:03:53,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16130 transitions. [2021-07-06 19:03:53,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2021-07-06 19:03:53,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2021-07-06 19:03:53,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16130 transitions. [2021-07-06 19:03:53,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:53,493 INFO L681 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2021-07-06 19:03:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16130 transitions. [2021-07-06 19:03:53,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2021-07-06 19:03:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11010 states, 11010 states have (on average 1.4650317892824705) internal successors, (16130), 11009 states have internal predecessors, (16130), 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:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16130 transitions. [2021-07-06 19:03:53,759 INFO L704 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2021-07-06 19:03:53,759 INFO L587 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2021-07-06 19:03:53,760 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-07-06 19:03:53,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16130 transitions. [2021-07-06 19:03:53,796 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2021-07-06 19:03:53,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:53,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:53,797 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:53,797 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:53,797 INFO L791 eck$LassoCheckResult]: Stem: 33523#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 33502#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 33503#L225-1 [2021-07-06 19:03:53,798 INFO L793 eck$LassoCheckResult]: Loop: 33503#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 33660#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 33658#L93 assume !(0 != main_~p1~0); 33656#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 33654#L97-1 assume !(0 != main_~p3~0); 33650#L101-1 assume !(0 != main_~p4~0); 33646#L105-1 assume !(0 != main_~p5~0); 33642#L109-1 assume !(0 != main_~p6~0); 33638#L113-1 assume !(0 != main_~p7~0); 33634#L117-1 assume !(0 != main_~p8~0); 33630#L121-1 assume !(0 != main_~p9~0); 33626#L125-1 assume !(0 != main_~p10~0); 33624#L129-1 assume !(0 != main_~p11~0); 33622#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 33620#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 33618#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 33616#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 33614#L149-1 assume !(0 != main_~p1~0); 33609#L155-1 assume 0 != main_~p2~0; 33606#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 33602#L160 assume !(0 != main_~p3~0); 33601#L165-1 assume !(0 != main_~p4~0); 33703#L170-1 assume !(0 != main_~p5~0); 33699#L175-1 assume !(0 != main_~p6~0); 33695#L180-1 assume !(0 != main_~p7~0); 33691#L185-1 assume !(0 != main_~p8~0); 33687#L190-1 assume !(0 != main_~p9~0); 33683#L195-1 assume !(0 != main_~p10~0); 33680#L200-1 assume !(0 != main_~p11~0); 33676#L205-1 assume !(0 != main_~p12~0); 33672#L210-1 assume !(0 != main_~p13~0); 33669#L215-1 assume 0 != main_~p14~0; 33667#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 33664#L220 assume !(0 != main_~p15~0); 33503#L225-1 [2021-07-06 19:03:53,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:53,798 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-07-06 19:03:53,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:53,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947784391] [2021-07-06 19:03:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:53,799 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:53,806 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:53,812 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:53,817 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:53,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:53,818 INFO L82 PathProgramCache]: Analyzing trace with hash 698995654, now seen corresponding path program 1 times [2021-07-06 19:03:53,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:53,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928166520] [2021-07-06 19:03:53,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:53,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:53,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:53,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:53,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:53,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:53,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:53,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:53,838 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:53,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:53,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928166520] [2021-07-06 19:03:53,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928166520] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:53,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:53,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:53,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609329440] [2021-07-06 19:03:53,839 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:53,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:53,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:53,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:53,840 INFO L87 Difference]: Start difference. First operand 11010 states and 16130 transitions. cyclomatic complexity: 5376 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:53,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:53,985 INFO L93 Difference]: Finished difference Result 21762 states and 31490 transitions. [2021-07-06 19:03:53,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:53,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 31490 transitions. [2021-07-06 19:03:54,102 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2021-07-06 19:03:54,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 31490 transitions. [2021-07-06 19:03:54,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2021-07-06 19:03:54,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2021-07-06 19:03:54,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 31490 transitions. [2021-07-06 19:03:54,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:54,232 INFO L681 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2021-07-06 19:03:54,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 31490 transitions. [2021-07-06 19:03:54,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2021-07-06 19:03:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 21762 states have (on average 1.447017737340318) internal successors, (31490), 21761 states have internal predecessors, (31490), 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:54,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 31490 transitions. [2021-07-06 19:03:54,650 INFO L704 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2021-07-06 19:03:54,650 INFO L587 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2021-07-06 19:03:54,650 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-07-06 19:03:54,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 31490 transitions. [2021-07-06 19:03:54,868 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2021-07-06 19:03:54,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:54,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:54,869 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:54,869 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:54,869 INFO L791 eck$LassoCheckResult]: Stem: 66300#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 66280#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 66281#L225-1 [2021-07-06 19:03:54,870 INFO L793 eck$LassoCheckResult]: Loop: 66281#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 66469#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 66465#L93 assume !(0 != main_~p1~0); 66461#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 66457#L97-1 assume !(0 != main_~p3~0); 66450#L101-1 assume !(0 != main_~p4~0); 66442#L105-1 assume !(0 != main_~p5~0); 66434#L109-1 assume !(0 != main_~p6~0); 66426#L113-1 assume !(0 != main_~p7~0); 66418#L117-1 assume !(0 != main_~p8~0); 66410#L121-1 assume !(0 != main_~p9~0); 66402#L125-1 assume !(0 != main_~p10~0); 66397#L129-1 assume !(0 != main_~p11~0); 66391#L133-1 assume !(0 != main_~p12~0); 66392#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 66382#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 66383#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 66374#L149-1 assume !(0 != main_~p1~0); 66375#L155-1 assume 0 != main_~p2~0; 66366#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 66367#L160 assume !(0 != main_~p3~0); 66568#L165-1 assume !(0 != main_~p4~0); 66564#L170-1 assume !(0 != main_~p5~0); 66560#L175-1 assume !(0 != main_~p6~0); 66539#L180-1 assume !(0 != main_~p7~0); 66531#L185-1 assume !(0 != main_~p8~0); 66523#L190-1 assume !(0 != main_~p9~0); 66516#L195-1 assume !(0 != main_~p10~0); 66510#L200-1 assume !(0 != main_~p11~0); 66507#L205-1 assume !(0 != main_~p12~0); 66506#L210-1 assume !(0 != main_~p13~0); 66504#L215-1 assume 0 != main_~p14~0; 66481#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 66478#L220 assume !(0 != main_~p15~0); 66281#L225-1 [2021-07-06 19:03:54,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:54,870 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-07-06 19:03:54,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:54,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316316939] [2021-07-06 19:03:54,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:54,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:54,877 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:54,892 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:54,895 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:54,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:54,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1121697480, now seen corresponding path program 1 times [2021-07-06 19:03:54,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:54,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313275119] [2021-07-06 19:03:54,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:54,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:54,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:54,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:54,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:54,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:54,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:54,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:54,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:54,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:54,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313275119] [2021-07-06 19:03:54,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313275119] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:54,915 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:54,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:54,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815143828] [2021-07-06 19:03:54,916 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:54,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:54,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:54,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:54,917 INFO L87 Difference]: Start difference. First operand 21762 states and 31490 transitions. cyclomatic complexity: 10240 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:55,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:55,084 INFO L93 Difference]: Finished difference Result 43010 states and 61442 transitions. [2021-07-06 19:03:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:55,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 61442 transitions. [2021-07-06 19:03:55,296 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2021-07-06 19:03:55,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 61442 transitions. [2021-07-06 19:03:55,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2021-07-06 19:03:55,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2021-07-06 19:03:55,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 61442 transitions. [2021-07-06 19:03:55,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:55,635 INFO L681 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2021-07-06 19:03:55,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 61442 transitions. [2021-07-06 19:03:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2021-07-06 19:03:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43010 states, 43010 states have (on average 1.4285514996512438) internal successors, (61442), 43009 states have internal predecessors, (61442), 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:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 61442 transitions. [2021-07-06 19:03:56,247 INFO L704 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2021-07-06 19:03:56,247 INFO L587 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2021-07-06 19:03:56,247 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-07-06 19:03:56,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 61442 transitions. [2021-07-06 19:03:56,549 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2021-07-06 19:03:56,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:56,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:56,550 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:56,550 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:56,550 INFO L791 eck$LassoCheckResult]: Stem: 131080#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 131059#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 131060#L225-1 [2021-07-06 19:03:56,551 INFO L793 eck$LassoCheckResult]: Loop: 131060#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 131332#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 131329#L93 assume !(0 != main_~p1~0); 131325#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 131321#L97-1 assume !(0 != main_~p3~0); 131290#L101-1 assume !(0 != main_~p4~0); 131286#L105-1 assume !(0 != main_~p5~0); 131282#L109-1 assume !(0 != main_~p6~0); 131278#L113-1 assume !(0 != main_~p7~0); 131275#L117-1 assume !(0 != main_~p8~0); 131191#L121-1 assume !(0 != main_~p9~0); 131187#L125-1 assume !(0 != main_~p10~0); 131174#L129-1 assume !(0 != main_~p11~0); 131175#L133-1 assume !(0 != main_~p12~0); 131452#L137-1 assume !(0 != main_~p13~0); 131453#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 131571#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 131568#L149-1 assume !(0 != main_~p1~0); 131565#L155-1 assume 0 != main_~p2~0; 131563#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 131558#L160 assume !(0 != main_~p3~0); 131550#L165-1 assume !(0 != main_~p4~0); 131542#L170-1 assume !(0 != main_~p5~0); 131537#L175-1 assume !(0 != main_~p6~0); 131532#L180-1 assume !(0 != main_~p7~0); 131528#L185-1 assume !(0 != main_~p8~0); 131503#L190-1 assume !(0 != main_~p9~0); 131358#L195-1 assume !(0 != main_~p10~0); 131353#L200-1 assume !(0 != main_~p11~0); 131345#L205-1 assume !(0 != main_~p12~0); 131342#L210-1 assume !(0 != main_~p13~0); 131341#L215-1 assume 0 != main_~p14~0; 131339#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 131337#L220 assume !(0 != main_~p15~0); 131060#L225-1 [2021-07-06 19:03:56,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:56,551 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-07-06 19:03:56,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:56,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966221662] [2021-07-06 19:03:56,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:56,552 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:56,561 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:56,580 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:56,586 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:56,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:56,587 INFO L82 PathProgramCache]: Analyzing trace with hash 304049030, now seen corresponding path program 1 times [2021-07-06 19:03:56,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:56,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646535539] [2021-07-06 19:03:56,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:56,587 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:56,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:56,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:56,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:56,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:56,611 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:56,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:56,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646535539] [2021-07-06 19:03:56,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646535539] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:56,612 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:56,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-06 19:03:56,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686352813] [2021-07-06 19:03:56,613 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:56,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:56,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:56,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:56,614 INFO L87 Difference]: Start difference. First operand 43010 states and 61442 transitions. cyclomatic complexity: 19456 Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:56,839 INFO L93 Difference]: Finished difference Result 84994 states and 119810 transitions. [2021-07-06 19:03:56,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:56,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 119810 transitions. [2021-07-06 19:03:57,363 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2021-07-06 19:03:57,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 119810 transitions. [2021-07-06 19:03:57,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2021-07-06 19:03:57,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2021-07-06 19:03:57,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 119810 transitions. [2021-07-06 19:03:57,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:57,920 INFO L681 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2021-07-06 19:03:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 119810 transitions. [2021-07-06 19:03:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2021-07-06 19:03:58,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84994 states, 84994 states have (on average 1.409628914982234) internal successors, (119810), 84993 states have internal predecessors, (119810), 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:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 119810 transitions. [2021-07-06 19:03:59,063 INFO L704 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2021-07-06 19:03:59,063 INFO L587 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2021-07-06 19:03:59,063 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-07-06 19:03:59,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 119810 transitions. [2021-07-06 19:03:59,320 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2021-07-06 19:03:59,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:59,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:59,321 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:59,321 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:59,321 INFO L791 eck$LassoCheckResult]: Stem: 259090#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 259069#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 259070#L225-1 [2021-07-06 19:03:59,322 INFO L793 eck$LassoCheckResult]: Loop: 259070#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 259503#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 259501#L93 assume !(0 != main_~p1~0); 259500#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 259498#L97-1 assume !(0 != main_~p3~0); 259495#L101-1 assume !(0 != main_~p4~0); 259491#L105-1 assume !(0 != main_~p5~0); 259487#L109-1 assume !(0 != main_~p6~0); 259483#L113-1 assume !(0 != main_~p7~0); 259479#L117-1 assume !(0 != main_~p8~0); 259475#L121-1 assume !(0 != main_~p9~0); 259471#L125-1 assume !(0 != main_~p10~0); 259468#L129-1 assume !(0 != main_~p11~0); 259465#L133-1 assume !(0 != main_~p12~0); 259461#L137-1 assume !(0 != main_~p13~0); 259458#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 259455#L145-1 assume !(0 != main_~p15~0); 259456#L149-1 assume !(0 != main_~p1~0); 259555#L155-1 assume 0 != main_~p2~0; 259553#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 259550#L160 assume !(0 != main_~p3~0); 259545#L165-1 assume !(0 != main_~p4~0); 259541#L170-1 assume !(0 != main_~p5~0); 259537#L175-1 assume !(0 != main_~p6~0); 259533#L180-1 assume !(0 != main_~p7~0); 259529#L185-1 assume !(0 != main_~p8~0); 259525#L190-1 assume !(0 != main_~p9~0); 259521#L195-1 assume !(0 != main_~p10~0); 259518#L200-1 assume !(0 != main_~p11~0); 259514#L205-1 assume !(0 != main_~p12~0); 259510#L210-1 assume !(0 != main_~p13~0); 259508#L215-1 assume 0 != main_~p14~0; 259506#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 259504#L220 assume !(0 != main_~p15~0); 259070#L225-1 [2021-07-06 19:03:59,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:59,322 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2021-07-06 19:03:59,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:59,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640964007] [2021-07-06 19:03:59,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:59,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:59,327 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:59,331 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:59,332 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:59,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:59,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1690095676, now seen corresponding path program 1 times [2021-07-06 19:03:59,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:59,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782428839] [2021-07-06 19:03:59,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:59,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:59,347 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:59,349 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:59,353 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:59,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:59,354 INFO L82 PathProgramCache]: Analyzing trace with hash 365150982, now seen corresponding path program 1 times [2021-07-06 19:03:59,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:59,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121403829] [2021-07-06 19:03:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:59,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:59,362 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:59,369 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:59,375 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:59,527 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-07-06 19:03:59,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:59,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 100 [2021-07-06 19:03:59,663 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-07-06 19:04:00,061 WARN L205 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2021-07-06 19:04:00,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:04:00,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2021-07-06 19:04:00,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 07:04:00 BoogieIcfgContainer [2021-07-06 19:04:00,175 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 19:04:00,176 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 19:04:00,176 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 19:04:00,176 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 19:04:00,177 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:51" (3/4) ... [2021-07-06 19:04:00,179 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 19:04:00,226 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 19:04:00,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 19:04:00,227 INFO L168 Benchmark]: Toolchain (without parser) took 9635.15 ms. Allocated memory was 44.0 MB in the beginning and 8.8 GB in the end (delta: 8.7 GB). Free memory was 27.0 MB in the beginning and 7.9 GB in the end (delta: -7.9 GB). Peak memory consumption was 861.6 MB. Max. memory is 16.1 GB. [2021-07-06 19:04:00,227 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 44.0 MB. Free memory was 26.1 MB in the beginning and 26.0 MB in the end (delta: 42.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 19:04:00,228 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.18 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 26.8 MB in the beginning and 38.2 MB in the end (delta: -11.5 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. [2021-07-06 19:04:00,230 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.17 ms. Allocated memory is still 54.5 MB. Free memory was 38.0 MB in the beginning and 36.4 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 19:04:00,230 INFO L168 Benchmark]: Boogie Preprocessor took 44.58 ms. Allocated memory is still 54.5 MB. Free memory was 36.4 MB in the beginning and 35.0 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 19:04:00,231 INFO L168 Benchmark]: RCFGBuilder took 429.06 ms. Allocated memory is still 54.5 MB. Free memory was 34.8 MB in the beginning and 24.3 MB in the end (delta: 10.5 MB). Peak memory consumption was 16.2 MB. Max. memory is 16.1 GB. [2021-07-06 19:04:00,231 INFO L168 Benchmark]: BuchiAutomizer took 8803.54 ms. Allocated memory was 54.5 MB in the beginning and 8.8 GB in the end (delta: 8.7 GB). Free memory was 24.1 MB in the beginning and 7.9 GB in the end (delta: -7.9 GB). Peak memory consumption was 844.4 MB. Max. memory is 16.1 GB. [2021-07-06 19:04:00,232 INFO L168 Benchmark]: Witness Printer took 50.51 ms. Allocated memory is still 8.8 GB. Free memory was 7.9 GB in the beginning and 7.9 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 19:04:00,236 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.17 ms. Allocated memory is still 44.0 MB. Free memory was 26.1 MB in the beginning and 26.0 MB in the end (delta: 42.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 253.18 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 26.8 MB in the beginning and 38.2 MB in the end (delta: -11.5 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.17 ms. Allocated memory is still 54.5 MB. Free memory was 38.0 MB in the beginning and 36.4 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.58 ms. Allocated memory is still 54.5 MB. Free memory was 36.4 MB in the beginning and 35.0 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 429.06 ms. Allocated memory is still 54.5 MB. Free memory was 34.8 MB in the beginning and 24.3 MB in the end (delta: 10.5 MB). Peak memory consumption was 16.2 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 8803.54 ms. Allocated memory was 54.5 MB in the beginning and 8.8 GB in the end (delta: 8.7 GB). Free memory was 24.1 MB in the beginning and 7.9 GB in the end (delta: -7.9 GB). Peak memory consumption was 844.4 MB. Max. memory is 16.1 GB. * Witness Printer took 50.51 ms. Allocated memory is still 8.8 GB. Free memory was 7.9 GB in the beginning and 7.9 GB in the end (delta: 2.1 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 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 84994 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.7s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 2714.5ms AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.8s Buchi closure took 0.1s. Biggest automaton had 84994 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1271 SDtfs, 648 SDslu, 801 SDs, 0 SdLazy, 55 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 108.7ms Time LassoAnalysisResults: nont1 unkn0 SFLI11 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: 56]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=10282} State at position 1 is {NULL=0, p1=0, p3=0, p5=0, NULL=10282, p10=0, p7=0, p9=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32d3226b=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29993897=0, p14=10, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@451af745=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d973569=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@335ef3dd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@236ec078=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@70fee532=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@99c3f30=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22f78412=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42ca4d5b=0, NULL=0, NULL=0, lk3=0, lk5=0, NULL=0, lk1=0, lk7=0, lk9=0, NULL=10285, \result=0, p2=13, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f7a956b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@368df660=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73e14f42=0, lk13=0, p15=0, lk15=0, p13=0, p11=0, lk11=0, cond=11, NULL=10284, NULL=0, NULL=10283, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31dcab8f=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2574fca0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@617023c8=11, lk6=0, lk2=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 56]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND TRUE p2 != 0 [L98] lk2 = 1 [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND TRUE p14 != 0 [L146] lk14 = 1 [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND TRUE p2 != 0 [L161] COND FALSE !(lk2 != 1) [L162] lk2 = 0 [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND TRUE p14 != 0 [L221] COND FALSE !(lk14 != 1) [L222] lk14 = 0 [L225] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 19:04:00,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...