./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/bin/uautomizer-WNIpwEf4Nt/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_7.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/bin/uautomizer-WNIpwEf4Nt --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 d2a1f90505878c0035f7701a954d17ca4375eb05 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 01:16:23,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 01:16:23,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 01:16:23,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 01:16:23,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 01:16:23,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 01:16:23,873 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 01:16:23,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 01:16:23,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 01:16:23,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 01:16:23,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 01:16:23,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 01:16:23,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 01:16:23,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 01:16:23,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 01:16:23,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 01:16:23,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 01:16:23,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 01:16:23,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 01:16:23,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 01:16:23,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 01:16:23,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 01:16:23,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 01:16:23,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 01:16:23,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 01:16:23,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 01:16:23,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 01:16:23,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 01:16:23,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 01:16:23,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 01:16:23,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 01:16:23,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 01:16:23,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 01:16:23,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 01:16:23,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 01:16:23,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 01:16:23,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 01:16:23,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 01:16:23,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 01:16:23,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 01:16:23,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 01:16:23,946 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-13 01:16:23,991 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 01:16:23,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 01:16:23,996 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 01:16:23,996 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 01:16:23,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 01:16:23,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 01:16:23,998 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 01:16:23,999 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-13 01:16:23,999 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-13 01:16:23,999 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-13 01:16:24,000 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-13 01:16:24,000 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-13 01:16:24,001 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-13 01:16:24,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 01:16:24,001 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 01:16:24,001 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 01:16:24,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 01:16:24,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 01:16:24,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 01:16:24,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-13 01:16:24,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-13 01:16:24,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-13 01:16:24,003 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 01:16:24,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 01:16:24,003 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-13 01:16:24,003 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 01:16:24,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-13 01:16:24,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 01:16:24,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 01:16:24,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 01:16:24,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 01:16:24,005 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 01:16:24,006 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-13 01:16:24,006 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/bin/uautomizer-WNIpwEf4Nt/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/bin/uautomizer-WNIpwEf4Nt 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 -> d2a1f90505878c0035f7701a954d17ca4375eb05 [2021-10-13 01:16:24,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 01:16:24,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 01:16:24,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 01:16:24,287 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 01:16:24,288 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 01:16:24,289 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/locks/test_locks_7.c [2021-10-13 01:16:24,362 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/bin/uautomizer-WNIpwEf4Nt/data/2693e355e/258315e8cfe64e0ebca19b741be1a1f9/FLAGae7ab90d9 [2021-10-13 01:16:24,797 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 01:16:24,797 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/sv-benchmarks/c/locks/test_locks_7.c [2021-10-13 01:16:24,803 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/bin/uautomizer-WNIpwEf4Nt/data/2693e355e/258315e8cfe64e0ebca19b741be1a1f9/FLAGae7ab90d9 [2021-10-13 01:16:25,172 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/bin/uautomizer-WNIpwEf4Nt/data/2693e355e/258315e8cfe64e0ebca19b741be1a1f9 [2021-10-13 01:16:25,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 01:16:25,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 01:16:25,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 01:16:25,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 01:16:25,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 01:16:25,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:16:25" (1/1) ... [2021-10-13 01:16:25,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31bfc010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:16:25, skipping insertion in model container [2021-10-13 01:16:25,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:16:25" (1/1) ... [2021-10-13 01:16:25,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 01:16:25,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 01:16:25,377 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/sv-benchmarks/c/locks/test_locks_7.c[2881,2894] [2021-10-13 01:16:25,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:16:25,386 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 01:16:25,403 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/sv-benchmarks/c/locks/test_locks_7.c[2881,2894] [2021-10-13 01:16:25,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:16:25,415 INFO L208 MainTranslator]: Completed translation [2021-10-13 01:16:25,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:16:25 WrapperNode [2021-10-13 01:16:25,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 01:16:25,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 01:16:25,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 01:16:25,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 01:16:25,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:16:25" (1/1) ... [2021-10-13 01:16:25,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:16:25" (1/1) ... [2021-10-13 01:16:25,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 01:16:25,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 01:16:25,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 01:16:25,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 01:16:25,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:16:25" (1/1) ... [2021-10-13 01:16:25,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:16:25" (1/1) ... [2021-10-13 01:16:25,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:16:25" (1/1) ... [2021-10-13 01:16:25,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:16:25" (1/1) ... [2021-10-13 01:16:25,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:16:25" (1/1) ... [2021-10-13 01:16:25,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:16:25" (1/1) ... [2021-10-13 01:16:25,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:16:25" (1/1) ... [2021-10-13 01:16:25,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 01:16:25,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 01:16:25,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 01:16:25,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 01:16:25,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:16:25" (1/1) ... [2021-10-13 01:16:25,489 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 01:16:25,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:16:25,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 01:16:25,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-13 01:16:25,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 01:16:25,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 01:16:25,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 01:16:25,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 01:16:25,859 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 01:16:25,860 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-13 01:16:25,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:16:25 BoogieIcfgContainer [2021-10-13 01:16:25,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 01:16:25,868 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-13 01:16:25,871 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-13 01:16:25,874 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-13 01:16:25,880 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 01:16:25,880 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 01:16:25" (1/3) ... [2021-10-13 01:16:25,882 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18e62389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 01:16:25, skipping insertion in model container [2021-10-13 01:16:25,882 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 01:16:25,882 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:16:25" (2/3) ... [2021-10-13 01:16:25,883 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18e62389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 01:16:25, skipping insertion in model container [2021-10-13 01:16:25,883 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 01:16:25,883 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:16:25" (3/3) ... [2021-10-13 01:16:25,893 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_7.c [2021-10-13 01:16:25,945 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-13 01:16:25,945 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-13 01:16:25,946 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-13 01:16:25,946 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-13 01:16:25,946 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-13 01:16:25,946 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-13 01:16:25,946 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-13 01:16:25,946 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-13 01:16:25,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 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-10-13 01:16:25,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-10-13 01:16:25,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:16:25,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:16:25,980 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:16:25,980 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:16:25,980 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-13 01:16:25,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 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-10-13 01:16:25,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-10-13 01:16:25,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:16:25,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:16:25,984 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:16:25,984 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:16:25,989 INFO L791 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 6#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_~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_~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;havoc main_~cond~0; 18#L113-1true [2021-10-13 01:16:25,989 INFO L793 eck$LassoCheckResult]: Loop: 18#L113-1true assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 29#L34true 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; 30#L53true assume 0 != main_~p1~0;main_~lk1~0 := 1; 4#L53-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 13#L57-1true assume !(0 != main_~p3~0); 10#L61-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 26#L65-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 28#L69-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 12#L73-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 25#L77-1true assume !(0 != main_~p1~0); 31#L83-1true assume !(0 != main_~p2~0); 15#L88-1true assume !(0 != main_~p3~0); 11#L93-1true assume !(0 != main_~p4~0); 16#L98-1true assume !(0 != main_~p5~0); 8#L103-1true assume !(0 != main_~p6~0); 14#L108-1true assume !(0 != main_~p7~0); 18#L113-1true [2021-10-13 01:16:25,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:25,995 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-10-13 01:16:26,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:26,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073727910] [2021-10-13 01:16:26,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:26,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:16:26,096 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:16:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:16:26,133 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:16:26,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:26,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2067454588, now seen corresponding path program 1 times [2021-10-13 01:16:26,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:26,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144135409] [2021-10-13 01:16:26,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:26,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:16:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:16:26,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:16:26,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144135409] [2021-10-13 01:16:26,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144135409] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:16:26,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:16:26,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:16:26,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77150201] [2021-10-13 01:16:26,222 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 01:16:26,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:16:26,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:16:26,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:16:26,239 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 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 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-10-13 01:16:26,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:16:26,275 INFO L93 Difference]: Finished difference Result 57 states and 94 transitions. [2021-10-13 01:16:26,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:16:26,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 94 transitions. [2021-10-13 01:16:26,281 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2021-10-13 01:16:26,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 47 states and 73 transitions. [2021-10-13 01:16:26,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2021-10-13 01:16:26,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2021-10-13 01:16:26,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2021-10-13 01:16:26,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 01:16:26,288 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2021-10-13 01:16:26,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2021-10-13 01:16:26,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-10-13 01:16:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.553191489361702) internal successors, (73), 46 states have internal predecessors, (73), 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-10-13 01:16:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2021-10-13 01:16:26,317 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2021-10-13 01:16:26,317 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2021-10-13 01:16:26,317 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-13 01:16:26,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 73 transitions. [2021-10-13 01:16:26,323 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2021-10-13 01:16:26,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:16:26,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:16:26,325 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:16:26,325 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:16:26,326 INFO L791 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 100#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_~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_~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;havoc main_~cond~0; 101#L113-1 [2021-10-13 01:16:26,327 INFO L793 eck$LassoCheckResult]: Loop: 101#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 116#L34 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; 121#L53 assume !(0 != main_~p1~0); 123#L53-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 142#L57-1 assume !(0 != main_~p3~0); 141#L61-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 140#L65-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 139#L69-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 138#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 137#L77-1 assume !(0 != main_~p1~0); 136#L83-1 assume !(0 != main_~p2~0); 134#L88-1 assume !(0 != main_~p3~0); 132#L93-1 assume !(0 != main_~p4~0); 129#L98-1 assume !(0 != main_~p5~0); 104#L103-1 assume !(0 != main_~p6~0); 106#L108-1 assume !(0 != main_~p7~0); 101#L113-1 [2021-10-13 01:16:26,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:26,329 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-10-13 01:16:26,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:26,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860990312] [2021-10-13 01:16:26,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:26,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:16:26,349 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:16:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:16:26,369 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:16:26,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:26,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1216395458, now seen corresponding path program 1 times [2021-10-13 01:16:26,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:26,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902073318] [2021-10-13 01:16:26,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:26,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:16:26,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:16:26,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:16:26,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902073318] [2021-10-13 01:16:26,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902073318] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:16:26,442 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:16:26,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:16:26,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75767711] [2021-10-13 01:16:26,443 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 01:16:26,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:16:26,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:16:26,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:16:26,447 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-10-13 01:16:26,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:16:26,479 INFO L93 Difference]: Finished difference Result 90 states and 138 transitions. [2021-10-13 01:16:26,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:16:26,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 138 transitions. [2021-10-13 01:16:26,484 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2021-10-13 01:16:26,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 138 transitions. [2021-10-13 01:16:26,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2021-10-13 01:16:26,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2021-10-13 01:16:26,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 138 transitions. [2021-10-13 01:16:26,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 01:16:26,494 INFO L681 BuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2021-10-13 01:16:26,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 138 transitions. [2021-10-13 01:16:26,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-10-13 01:16:26,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 89 states have internal predecessors, (138), 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-10-13 01:16:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2021-10-13 01:16:26,509 INFO L704 BuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2021-10-13 01:16:26,509 INFO L587 BuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2021-10-13 01:16:26,509 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-13 01:16:26,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 138 transitions. [2021-10-13 01:16:26,514 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2021-10-13 01:16:26,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:16:26,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:16:26,517 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:16:26,517 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:16:26,517 INFO L791 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 243#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_~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_~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;havoc main_~cond~0; 244#L113-1 [2021-10-13 01:16:26,518 INFO L793 eck$LassoCheckResult]: Loop: 244#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 305#L34 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; 287#L53 assume !(0 != main_~p1~0); 289#L53-2 assume !(0 != main_~p2~0); 255#L57-1 assume !(0 != main_~p3~0); 250#L61-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 251#L65-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 269#L69-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 293#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 292#L77-1 assume !(0 != main_~p1~0); 273#L83-1 assume !(0 != main_~p2~0); 274#L88-1 assume !(0 != main_~p3~0); 320#L93-1 assume !(0 != main_~p4~0); 317#L98-1 assume !(0 != main_~p5~0); 315#L103-1 assume !(0 != main_~p6~0); 311#L108-1 assume !(0 != main_~p7~0); 244#L113-1 [2021-10-13 01:16:26,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:26,523 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-10-13 01:16:26,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:26,524 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811975227] [2021-10-13 01:16:26,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:26,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:16:26,544 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:16:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:16:26,570 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:16:26,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:26,571 INFO L82 PathProgramCache]: Analyzing trace with hash 629589444, now seen corresponding path program 1 times [2021-10-13 01:16:26,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:26,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262715551] [2021-10-13 01:16:26,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:26,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:16:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:16:26,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:16:26,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262715551] [2021-10-13 01:16:26,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262715551] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:16:26,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:16:26,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:16:26,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345673725] [2021-10-13 01:16:26,600 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 01:16:26,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:16:26,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:16:26,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:16:26,601 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-10-13 01:16:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:16:26,617 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2021-10-13 01:16:26,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:16:26,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 262 transitions. [2021-10-13 01:16:26,621 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2021-10-13 01:16:26,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 262 transitions. [2021-10-13 01:16:26,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2021-10-13 01:16:26,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2021-10-13 01:16:26,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 262 transitions. [2021-10-13 01:16:26,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 01:16:26,626 INFO L681 BuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2021-10-13 01:16:26,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 262 transitions. [2021-10-13 01:16:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2021-10-13 01:16:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5057471264367817) internal successors, (262), 173 states have internal predecessors, (262), 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-10-13 01:16:26,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2021-10-13 01:16:26,640 INFO L704 BuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2021-10-13 01:16:26,640 INFO L587 BuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2021-10-13 01:16:26,640 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-13 01:16:26,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 262 transitions. [2021-10-13 01:16:26,643 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2021-10-13 01:16:26,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:16:26,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:16:26,644 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:16:26,644 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:16:26,644 INFO L791 eck$LassoCheckResult]: Stem: 536#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 513#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_~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_~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;havoc main_~cond~0; 514#L113-1 [2021-10-13 01:16:26,644 INFO L793 eck$LassoCheckResult]: Loop: 514#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 575#L34 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; 558#L53 assume !(0 != main_~p1~0); 559#L53-2 assume !(0 != main_~p2~0); 632#L57-1 assume !(0 != main_~p3~0); 629#L61-1 assume !(0 != main_~p4~0); 627#L65-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 625#L69-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 623#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 621#L77-1 assume !(0 != main_~p1~0); 618#L83-1 assume !(0 != main_~p2~0); 615#L88-1 assume !(0 != main_~p3~0); 612#L93-1 assume !(0 != main_~p4~0); 608#L98-1 assume !(0 != main_~p5~0); 605#L103-1 assume !(0 != main_~p6~0); 580#L108-1 assume !(0 != main_~p7~0); 514#L113-1 [2021-10-13 01:16:26,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:26,645 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-10-13 01:16:26,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:26,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657624172] [2021-10-13 01:16:26,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:26,645 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:16:26,655 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:16:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:16:26,668 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:16:26,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:26,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1330654022, now seen corresponding path program 1 times [2021-10-13 01:16:26,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:26,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679052952] [2021-10-13 01:16:26,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:26,670 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:16:26,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:16:26,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:16:26,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679052952] [2021-10-13 01:16:26,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679052952] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:16:26,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:16:26,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:16:26,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953351362] [2021-10-13 01:16:26,694 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 01:16:26,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:16:26,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:16:26,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:16:26,695 INFO L87 Difference]: Start difference. First operand 174 states and 262 transitions. cyclomatic complexity: 96 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-10-13 01:16:26,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:16:26,717 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2021-10-13 01:16:26,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:16:26,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 498 transitions. [2021-10-13 01:16:26,722 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2021-10-13 01:16:26,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 338 states and 498 transitions. [2021-10-13 01:16:26,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2021-10-13 01:16:26,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2021-10-13 01:16:26,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 498 transitions. [2021-10-13 01:16:26,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 01:16:26,730 INFO L681 BuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2021-10-13 01:16:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 498 transitions. [2021-10-13 01:16:26,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2021-10-13 01:16:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 338 states have (on average 1.4733727810650887) internal successors, (498), 337 states have internal predecessors, (498), 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-10-13 01:16:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 498 transitions. [2021-10-13 01:16:26,754 INFO L704 BuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2021-10-13 01:16:26,754 INFO L587 BuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2021-10-13 01:16:26,754 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-13 01:16:26,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 498 transitions. [2021-10-13 01:16:26,756 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2021-10-13 01:16:26,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:16:26,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:16:26,762 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:16:26,762 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:16:26,762 INFO L791 eck$LassoCheckResult]: Stem: 1055#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1031#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_~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_~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;havoc main_~cond~0; 1032#L113-1 [2021-10-13 01:16:26,762 INFO L793 eck$LassoCheckResult]: Loop: 1032#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 1129#L34 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; 1114#L53 assume !(0 != main_~p1~0); 1116#L53-2 assume !(0 != main_~p2~0); 1096#L57-1 assume !(0 != main_~p3~0); 1097#L61-1 assume !(0 != main_~p4~0); 1168#L65-1 assume !(0 != main_~p5~0); 1167#L69-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1166#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1164#L77-1 assume !(0 != main_~p1~0); 1160#L83-1 assume !(0 != main_~p2~0); 1157#L88-1 assume !(0 != main_~p3~0); 1153#L93-1 assume !(0 != main_~p4~0); 1154#L98-1 assume !(0 != main_~p5~0); 1145#L103-1 assume !(0 != main_~p6~0); 1144#L108-1 assume !(0 != main_~p7~0); 1032#L113-1 [2021-10-13 01:16:26,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:26,763 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-10-13 01:16:26,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:26,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535313705] [2021-10-13 01:16:26,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:26,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:16:26,773 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:16:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:16:26,795 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:16:26,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:26,797 INFO L82 PathProgramCache]: Analyzing trace with hash 937627012, now seen corresponding path program 1 times [2021-10-13 01:16:26,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:26,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396797405] [2021-10-13 01:16:26,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:26,798 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:16:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:16:26,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:16:26,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396797405] [2021-10-13 01:16:26,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396797405] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:16:26,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:16:26,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:16:26,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663451885] [2021-10-13 01:16:26,860 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 01:16:26,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:16:26,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:16:26,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:16:26,861 INFO L87 Difference]: Start difference. First operand 338 states and 498 transitions. cyclomatic complexity: 176 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-10-13 01:16:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:16:26,894 INFO L93 Difference]: Finished difference Result 658 states and 946 transitions. [2021-10-13 01:16:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:16:26,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 658 states and 946 transitions. [2021-10-13 01:16:26,904 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2021-10-13 01:16:26,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 658 states to 658 states and 946 transitions. [2021-10-13 01:16:26,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 658 [2021-10-13 01:16:26,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 658 [2021-10-13 01:16:26,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 658 states and 946 transitions. [2021-10-13 01:16:26,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 01:16:26,928 INFO L681 BuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2021-10-13 01:16:26,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states and 946 transitions. [2021-10-13 01:16:26,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2021-10-13 01:16:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 658 states have (on average 1.4376899696048633) internal successors, (946), 657 states have internal predecessors, (946), 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-10-13 01:16:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 946 transitions. [2021-10-13 01:16:26,972 INFO L704 BuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2021-10-13 01:16:26,972 INFO L587 BuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2021-10-13 01:16:26,972 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-13 01:16:26,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 658 states and 946 transitions. [2021-10-13 01:16:26,979 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2021-10-13 01:16:26,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:16:26,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:16:26,980 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:16:26,980 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:16:26,981 INFO L791 eck$LassoCheckResult]: Stem: 2056#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2033#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_~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_~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;havoc main_~cond~0; 2034#L113-1 [2021-10-13 01:16:26,981 INFO L793 eck$LassoCheckResult]: Loop: 2034#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 2163#L34 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; 2159#L53 assume !(0 != main_~p1~0); 2157#L53-2 assume !(0 != main_~p2~0); 2154#L57-1 assume !(0 != main_~p3~0); 2150#L61-1 assume !(0 != main_~p4~0); 2147#L65-1 assume !(0 != main_~p5~0); 2148#L69-1 assume !(0 != main_~p6~0); 2139#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2140#L77-1 assume !(0 != main_~p1~0); 2128#L83-1 assume !(0 != main_~p2~0); 2130#L88-1 assume !(0 != main_~p3~0); 2118#L93-1 assume !(0 != main_~p4~0); 2119#L98-1 assume !(0 != main_~p5~0); 2172#L103-1 assume !(0 != main_~p6~0); 2169#L108-1 assume !(0 != main_~p7~0); 2034#L113-1 [2021-10-13 01:16:26,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:26,982 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-10-13 01:16:26,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:26,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061203098] [2021-10-13 01:16:26,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:26,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:16:27,009 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:16:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:16:27,030 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:16:27,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:27,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1617685382, now seen corresponding path program 1 times [2021-10-13 01:16:27,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:27,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463939917] [2021-10-13 01:16:27,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:27,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:16:27,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:16:27,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:16:27,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463939917] [2021-10-13 01:16:27,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463939917] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:16:27,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:16:27,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 01:16:27,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530694] [2021-10-13 01:16:27,066 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 01:16:27,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:16:27,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:16:27,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:16:27,068 INFO L87 Difference]: Start difference. First operand 658 states and 946 transitions. cyclomatic complexity: 320 Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-10-13 01:16:27,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:16:27,115 INFO L93 Difference]: Finished difference Result 1282 states and 1794 transitions. [2021-10-13 01:16:27,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:16:27,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1282 states and 1794 transitions. [2021-10-13 01:16:27,131 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2021-10-13 01:16:27,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1282 states to 1282 states and 1794 transitions. [2021-10-13 01:16:27,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1282 [2021-10-13 01:16:27,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1282 [2021-10-13 01:16:27,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1282 states and 1794 transitions. [2021-10-13 01:16:27,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 01:16:27,147 INFO L681 BuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2021-10-13 01:16:27,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states and 1794 transitions. [2021-10-13 01:16:27,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2021-10-13 01:16:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1282 states have (on average 1.3993759750390016) internal successors, (1794), 1281 states have internal predecessors, (1794), 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-10-13 01:16:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1794 transitions. [2021-10-13 01:16:27,186 INFO L704 BuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2021-10-13 01:16:27,186 INFO L587 BuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2021-10-13 01:16:27,187 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-13 01:16:27,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1282 states and 1794 transitions. [2021-10-13 01:16:27,198 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2021-10-13 01:16:27,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:16:27,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:16:27,199 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:16:27,199 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:16:27,199 INFO L791 eck$LassoCheckResult]: Stem: 4003#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3979#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_~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_~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;havoc main_~cond~0; 3980#L113-1 [2021-10-13 01:16:27,200 INFO L793 eck$LassoCheckResult]: Loop: 3980#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 4339#L34 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; 4336#L53 assume !(0 != main_~p1~0); 4332#L53-2 assume !(0 != main_~p2~0); 4329#L57-1 assume !(0 != main_~p3~0); 4326#L61-1 assume !(0 != main_~p4~0); 4322#L65-1 assume !(0 != main_~p5~0); 4323#L69-1 assume !(0 != main_~p6~0); 4367#L73-1 assume !(0 != main_~p7~0); 4361#L77-1 assume !(0 != main_~p1~0); 4356#L83-1 assume !(0 != main_~p2~0); 4352#L88-1 assume !(0 != main_~p3~0); 4348#L93-1 assume !(0 != main_~p4~0); 4346#L98-1 assume !(0 != main_~p5~0); 4345#L103-1 assume !(0 != main_~p6~0); 4343#L108-1 assume !(0 != main_~p7~0); 3980#L113-1 [2021-10-13 01:16:27,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:27,203 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-10-13 01:16:27,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:27,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357274430] [2021-10-13 01:16:27,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:27,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:16:27,227 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:16:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:16:27,247 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:16:27,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:27,253 INFO L82 PathProgramCache]: Analyzing trace with hash 808338756, now seen corresponding path program 1 times [2021-10-13 01:16:27,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:27,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613875675] [2021-10-13 01:16:27,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:27,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:16:27,260 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:16:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:16:27,271 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:16:27,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:27,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1317176582, now seen corresponding path program 1 times [2021-10-13 01:16:27,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:27,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851454327] [2021-10-13 01:16:27,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:27,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:16:27,294 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:16:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:16:27,316 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:16:27,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 01:16:27 BoogieIcfgContainer [2021-10-13 01:16:27,867 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-13 01:16:27,868 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 01:16:27,868 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 01:16:27,868 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 01:16:27,869 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:16:25" (3/4) ... [2021-10-13 01:16:27,870 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-10-13 01:16:27,921 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 01:16:27,921 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 01:16:27,923 INFO L168 Benchmark]: Toolchain (without parser) took 2746.64 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 62.0 MB in the beginning and 93.9 MB in the end (delta: -32.0 MB). Peak memory consumption was 39.6 MB. Max. memory is 16.1 GB. [2021-10-13 01:16:27,923 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 98.6 MB. Free memory is still 79.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:16:27,924 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.55 ms. Allocated memory is still 98.6 MB. Free memory was 61.8 MB in the beginning and 74.7 MB in the end (delta: -12.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 01:16:27,924 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.21 ms. Allocated memory is still 98.6 MB. Free memory was 74.7 MB in the beginning and 73.1 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:16:27,925 INFO L168 Benchmark]: Boogie Preprocessor took 22.09 ms. Allocated memory is still 98.6 MB. Free memory was 73.1 MB in the beginning and 72.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 01:16:27,925 INFO L168 Benchmark]: RCFGBuilder took 386.40 ms. Allocated memory is still 98.6 MB. Free memory was 72.0 MB in the beginning and 61.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 01:16:27,926 INFO L168 Benchmark]: BuchiAutomizer took 1999.58 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 61.2 MB in the beginning and 49.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 34.9 MB. Max. memory is 16.1 GB. [2021-10-13 01:16:27,926 INFO L168 Benchmark]: Witness Printer took 53.52 ms. Allocated memory is still 119.5 MB. Free memory was 49.2 MB in the beginning and 93.9 MB in the end (delta: -44.7 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2021-10-13 01:16:27,929 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.20 ms. Allocated memory is still 98.6 MB. Free memory is still 79.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 239.55 ms. Allocated memory is still 98.6 MB. Free memory was 61.8 MB in the beginning and 74.7 MB in the end (delta: -12.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.21 ms. Allocated memory is still 98.6 MB. Free memory was 74.7 MB in the beginning and 73.1 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 22.09 ms. Allocated memory is still 98.6 MB. Free memory was 73.1 MB in the beginning and 72.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 386.40 ms. Allocated memory is still 98.6 MB. Free memory was 72.0 MB in the beginning and 61.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 1999.58 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 61.2 MB in the beginning and 49.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 34.9 MB. Max. memory is 16.1 GB. * Witness Printer took 53.52 ms. Allocated memory is still 119.5 MB. Free memory was 49.2 MB in the beginning and 93.9 MB in the end (delta: -44.7 MB). Peak memory consumption was 5.5 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 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1282 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 151.5ms AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1282 states and ocurred in iteration 6. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 350 SDtfs, 179 SDslu, 208 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 59.3ms Time LassoAnalysisResults: nont1 unkn0 SFLI6 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: 32]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=8573} State at position 1 is {NULL=8574, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=8573, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@599d8799=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a7ef252=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d3188c1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c338603=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19a77d53=0, cond=9, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5406e057=0, NULL=8575, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55f00d96=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65c39ab5=9, NULL=0, NULL=0, NULL=0, NULL=8576, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0, lk7=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 32]: 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; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-10-13 01:16:27,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96ede80d-d835-4438-b2af-12120ef35f6e/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...