./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_14-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/bin/uautomizer-J5u9QxTXDZ/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_14-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/bin/uautomizer-J5u9QxTXDZ --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 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-dbf71c6-m [2022-10-17 10:41:25,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:41:25,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:41:25,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:41:25,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:41:25,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:41:25,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:41:25,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:41:25,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:41:25,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:41:25,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:41:25,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:41:25,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:41:25,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:41:25,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:41:25,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:41:25,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:41:25,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:41:25,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:41:25,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:41:25,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:41:25,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:41:25,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:41:25,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:41:25,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:41:25,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:41:25,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:41:25,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:41:25,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:41:25,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:41:25,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:41:25,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:41:25,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:41:25,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:41:25,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:41:25,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:41:25,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:41:25,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:41:25,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:41:25,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:41:25,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:41:25,573 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-10-17 10:41:25,604 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:41:25,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:41:25,605 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:41:25,606 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:41:25,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:41:25,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:41:25,607 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:41:25,608 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-10-17 10:41:25,608 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-10-17 10:41:25,608 INFO L138 SettingsManager]: * Use old map elimination=false [2022-10-17 10:41:25,609 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-10-17 10:41:25,609 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-10-17 10:41:25,609 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-10-17 10:41:25,609 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:41:25,610 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:41:25,610 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-17 10:41:25,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:41:25,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:41:25,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:41:25,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-10-17 10:41:25,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-10-17 10:41:25,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-10-17 10:41:25,611 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:41:25,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 10:41:25,612 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-10-17 10:41:25,612 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:41:25,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-10-17 10:41:25,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:41:25,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:41:25,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:41:25,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:41:25,614 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-10-17 10:41:25,614 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_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/bin/uautomizer-J5u9QxTXDZ/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_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/bin/uautomizer-J5u9QxTXDZ 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 -> 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd [2022-10-17 10:41:25,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:41:25,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:41:25,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:41:25,892 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:41:25,893 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:41:25,894 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/locks/test_locks_14-1.c [2022-10-17 10:41:25,971 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/bin/uautomizer-J5u9QxTXDZ/data/4259298a9/91813f0abcb24a09a7638b15541de147/FLAGa10ea8624 [2022-10-17 10:41:26,439 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:41:26,445 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/sv-benchmarks/c/locks/test_locks_14-1.c [2022-10-17 10:41:26,456 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/bin/uautomizer-J5u9QxTXDZ/data/4259298a9/91813f0abcb24a09a7638b15541de147/FLAGa10ea8624 [2022-10-17 10:41:26,803 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/bin/uautomizer-J5u9QxTXDZ/data/4259298a9/91813f0abcb24a09a7638b15541de147 [2022-10-17 10:41:26,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:41:26,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:41:26,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:41:26,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:41:26,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:41:26,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:41:26" (1/1) ... [2022-10-17 10:41:26,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a63eab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:26, skipping insertion in model container [2022-10-17 10:41:26,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:41:26" (1/1) ... [2022-10-17 10:41:26,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:41:26,859 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:41:27,056 WARN L230 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_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2022-10-17 10:41:27,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:41:27,072 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:41:27,120 WARN L230 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_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2022-10-17 10:41:27,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:41:27,144 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:41:27,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:27 WrapperNode [2022-10-17 10:41:27,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:41:27,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:41:27,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:41:27,146 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:41:27,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:27" (1/1) ... [2022-10-17 10:41:27,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:27" (1/1) ... [2022-10-17 10:41:27,183 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 167 [2022-10-17 10:41:27,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:41:27,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:41:27,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:41:27,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:41:27,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:27" (1/1) ... [2022-10-17 10:41:27,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:27" (1/1) ... [2022-10-17 10:41:27,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:27" (1/1) ... [2022-10-17 10:41:27,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:27" (1/1) ... [2022-10-17 10:41:27,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:27" (1/1) ... [2022-10-17 10:41:27,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:27" (1/1) ... [2022-10-17 10:41:27,223 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:27" (1/1) ... [2022-10-17 10:41:27,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:27" (1/1) ... [2022-10-17 10:41:27,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:41:27,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:41:27,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:41:27,229 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:41:27,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:27" (1/1) ... [2022-10-17 10:41:27,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:41:27,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:41:27,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-10-17 10:41:27,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-10-17 10:41:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:41:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:41:27,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:41:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:41:27,400 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:41:27,402 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:41:27,653 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:41:27,667 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:41:27,668 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-17 10:41:27,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:41:27 BoogieIcfgContainer [2022-10-17 10:41:27,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:41:27,672 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-10-17 10:41:27,686 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-10-17 10:41:27,690 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-10-17 10:41:27,691 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-10-17 10:41:27,692 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.10 10:41:26" (1/3) ... [2022-10-17 10:41:27,693 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48219373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.10 10:41:27, skipping insertion in model container [2022-10-17 10:41:27,693 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-10-17 10:41:27,693 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:27" (2/3) ... [2022-10-17 10:41:27,693 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48219373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.10 10:41:27, skipping insertion in model container [2022-10-17 10:41:27,694 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-10-17 10:41:27,694 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:41:27" (3/3) ... [2022-10-17 10:41:27,695 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_14-1.c [2022-10-17 10:41:27,800 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-10-17 10:41:27,800 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-10-17 10:41:27,800 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-10-17 10:41:27,800 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-10-17 10:41:27,800 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-10-17 10:41:27,801 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-10-17 10:41:27,801 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-10-17 10:41:27,801 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-10-17 10:41:27,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 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) [2022-10-17 10:41:27,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2022-10-17 10:41:27,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:41:27,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:41:27,847 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:41:27,847 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:41:27,847 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-10-17 10:41:27,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 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) [2022-10-17 10:41:27,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2022-10-17 10:41:27,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:41:27,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:41:27,860 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:41:27,861 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:41:27,869 INFO L748 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 34#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 36#L211-1true [2022-10-17 10:41:27,873 INFO L750 eck$LassoCheckResult]: Loop: 36#L211-1true assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 45#L55true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 21#L88true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 11#L88-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 32#L92-1true assume !(0 != main_~p3~0#1); 3#L96-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 6#L100-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 48#L104-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 12#L108-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 51#L112-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 25#L116-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 39#L120-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 33#L124-1true assume !(0 != main_~p11~0#1); 15#L128-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 46#L132-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 42#L136-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 38#L140-1true assume !(0 != main_~p1~0#1); 16#L146-1true assume !(0 != main_~p2~0#1); 30#L151-1true assume !(0 != main_~p3~0#1); 28#L156-1true assume !(0 != main_~p4~0#1); 4#L161-1true assume !(0 != main_~p5~0#1); 10#L166-1true assume !(0 != main_~p6~0#1); 23#L171-1true assume !(0 != main_~p7~0#1); 19#L176-1true assume !(0 != main_~p8~0#1); 49#L181-1true assume !(0 != main_~p9~0#1); 20#L186-1true assume !(0 != main_~p10~0#1); 37#L191-1true assume !(0 != main_~p11~0#1); 50#L196-1true assume !(0 != main_~p12~0#1); 24#L201-1true assume !(0 != main_~p13~0#1); 13#L206-1true assume !(0 != main_~p14~0#1); 36#L211-1true [2022-10-17 10:41:27,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:27,899 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-10-17 10:41:27,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:27,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663141986] [2022-10-17 10:41:27,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:27,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:28,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:41:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:28,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:41:28,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:28,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1221430905, now seen corresponding path program 1 times [2022-10-17 10:41:28,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:28,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023258579] [2022-10-17 10:41:28,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:28,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:28,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:28,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023258579] [2022-10-17 10:41:28,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023258579] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:28,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:28,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:41:28,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458592495] [2022-10-17 10:41:28,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:28,215 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:41:28,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:28,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:41:28,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:41:28,265 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 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 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-10-17 10:41:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:28,308 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2022-10-17 10:41:28,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 178 transitions. [2022-10-17 10:41:28,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2022-10-17 10:41:28,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 89 states and 143 transitions. [2022-10-17 10:41:28,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2022-10-17 10:41:28,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2022-10-17 10:41:28,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 143 transitions. [2022-10-17 10:41:28,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:41:28,344 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 143 transitions. [2022-10-17 10:41:28,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 143 transitions. [2022-10-17 10:41:28,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-10-17 10:41:28,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.6067415730337078) internal successors, (143), 88 states have internal predecessors, (143), 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) [2022-10-17 10:41:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 143 transitions. [2022-10-17 10:41:28,387 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 143 transitions. [2022-10-17 10:41:28,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:41:28,393 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2022-10-17 10:41:28,393 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-10-17 10:41:28,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 143 transitions. [2022-10-17 10:41:28,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2022-10-17 10:41:28,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:41:28,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:41:28,397 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:41:28,398 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:41:28,398 INFO L748 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 174#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 168#L211-1 [2022-10-17 10:41:28,398 INFO L750 eck$LassoCheckResult]: Loop: 168#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 179#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 202#L88 assume !(0 != main_~p1~0#1); 221#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 220#L92-1 assume !(0 != main_~p3~0#1); 219#L96-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 218#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 208#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 185#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 186#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 205#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 183#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 172#L124-1 assume !(0 != main_~p11~0#1); 173#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 192#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 213#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 211#L140-1 assume !(0 != main_~p1~0#1); 212#L146-1 assume !(0 != main_~p2~0#1); 246#L151-1 assume !(0 != main_~p3~0#1); 244#L156-1 assume !(0 != main_~p4~0#1); 242#L161-1 assume !(0 != main_~p5~0#1); 240#L166-1 assume !(0 != main_~p6~0#1); 237#L171-1 assume !(0 != main_~p7~0#1); 236#L176-1 assume !(0 != main_~p8~0#1); 207#L181-1 assume !(0 != main_~p9~0#1); 194#L186-1 assume !(0 != main_~p10~0#1); 180#L191-1 assume !(0 != main_~p11~0#1); 176#L196-1 assume !(0 != main_~p12~0#1); 189#L201-1 assume !(0 != main_~p13~0#1); 166#L206-1 assume !(0 != main_~p14~0#1); 168#L211-1 [2022-10-17 10:41:28,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:28,399 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-10-17 10:41:28,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:28,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292362275] [2022-10-17 10:41:28,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:28,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:28,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:41:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:28,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:41:28,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:28,421 INFO L85 PathProgramCache]: Analyzing trace with hash 711957815, now seen corresponding path program 1 times [2022-10-17 10:41:28,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:28,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701720612] [2022-10-17 10:41:28,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:28,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:28,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:28,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701720612] [2022-10-17 10:41:28,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701720612] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:28,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:28,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:41:28,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663522082] [2022-10-17 10:41:28,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:28,517 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:41:28,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:28,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:41:28,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:41:28,519 INFO L87 Difference]: Start difference. First operand 89 states and 143 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-10-17 10:41:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:28,543 INFO L93 Difference]: Finished difference Result 174 states and 278 transitions. [2022-10-17 10:41:28,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 278 transitions. [2022-10-17 10:41:28,549 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2022-10-17 10:41:28,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 278 transitions. [2022-10-17 10:41:28,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2022-10-17 10:41:28,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2022-10-17 10:41:28,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 278 transitions. [2022-10-17 10:41:28,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:41:28,556 INFO L218 hiAutomatonCegarLoop]: Abstraction has 174 states and 278 transitions. [2022-10-17 10:41:28,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 278 transitions. [2022-10-17 10:41:28,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-10-17 10:41:28,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 173 states have internal predecessors, (278), 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) [2022-10-17 10:41:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 278 transitions. [2022-10-17 10:41:28,574 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 278 transitions. [2022-10-17 10:41:28,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:41:28,576 INFO L428 stractBuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2022-10-17 10:41:28,576 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-10-17 10:41:28,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 278 transitions. [2022-10-17 10:41:28,579 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2022-10-17 10:41:28,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:41:28,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:41:28,581 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:41:28,581 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:41:28,581 INFO L748 eck$LassoCheckResult]: Stem: 465#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 444#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 445#L211-1 [2022-10-17 10:41:28,582 INFO L750 eck$LassoCheckResult]: Loop: 445#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 527#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 525#L88 assume !(0 != main_~p1~0#1); 522#L88-2 assume !(0 != main_~p2~0#1); 517#L92-1 assume !(0 != main_~p3~0#1); 516#L96-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 514#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 512#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 511#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 510#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 509#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 508#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 507#L124-1 assume !(0 != main_~p11~0#1); 506#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 505#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 489#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 490#L140-1 assume !(0 != main_~p1~0#1); 499#L146-1 assume !(0 != main_~p2~0#1); 501#L151-1 assume !(0 != main_~p3~0#1); 550#L156-1 assume !(0 != main_~p4~0#1); 548#L161-1 assume !(0 != main_~p5~0#1); 546#L166-1 assume !(0 != main_~p6~0#1); 543#L171-1 assume !(0 != main_~p7~0#1); 542#L176-1 assume !(0 != main_~p8~0#1); 540#L181-1 assume !(0 != main_~p9~0#1); 537#L186-1 assume !(0 != main_~p10~0#1); 536#L191-1 assume !(0 != main_~p11~0#1); 534#L196-1 assume !(0 != main_~p12~0#1); 532#L201-1 assume !(0 != main_~p13~0#1); 530#L206-1 assume !(0 != main_~p14~0#1); 445#L211-1 [2022-10-17 10:41:28,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:28,583 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-10-17 10:41:28,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:28,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371600867] [2022-10-17 10:41:28,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:28,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:28,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:41:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:28,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:41:28,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:28,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1659781447, now seen corresponding path program 1 times [2022-10-17 10:41:28,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:28,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104959204] [2022-10-17 10:41:28,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:28,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:28,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:28,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104959204] [2022-10-17 10:41:28,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104959204] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:28,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:28,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:41:28,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420374383] [2022-10-17 10:41:28,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:28,665 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:41:28,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:28,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:41:28,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:41:28,667 INFO L87 Difference]: Start difference. First operand 174 states and 278 transitions. cyclomatic complexity: 108 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-10-17 10:41:28,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:28,707 INFO L93 Difference]: Finished difference Result 342 states and 542 transitions. [2022-10-17 10:41:28,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 542 transitions. [2022-10-17 10:41:28,713 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2022-10-17 10:41:28,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 542 transitions. [2022-10-17 10:41:28,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2022-10-17 10:41:28,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2022-10-17 10:41:28,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 542 transitions. [2022-10-17 10:41:28,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:41:28,732 INFO L218 hiAutomatonCegarLoop]: Abstraction has 342 states and 542 transitions. [2022-10-17 10:41:28,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 542 transitions. [2022-10-17 10:41:28,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-10-17 10:41:28,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 342 states have (on average 1.5847953216374269) internal successors, (542), 341 states have internal predecessors, (542), 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) [2022-10-17 10:41:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 542 transitions. [2022-10-17 10:41:28,763 INFO L240 hiAutomatonCegarLoop]: Abstraction has 342 states and 542 transitions. [2022-10-17 10:41:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:41:28,771 INFO L428 stractBuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2022-10-17 10:41:28,772 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-10-17 10:41:28,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 542 transitions. [2022-10-17 10:41:28,775 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2022-10-17 10:41:28,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:41:28,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:41:28,777 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:41:28,779 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:41:28,779 INFO L748 eck$LassoCheckResult]: Stem: 983#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 967#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 968#L211-1 [2022-10-17 10:41:28,781 INFO L750 eck$LassoCheckResult]: Loop: 968#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1027#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 1022#L88 assume !(0 != main_~p1~0#1); 1023#L88-2 assume !(0 != main_~p2~0#1); 1152#L92-1 assume !(0 != main_~p3~0#1); 1149#L96-1 assume !(0 != main_~p4~0#1); 1147#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1145#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1143#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1141#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1139#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1137#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1135#L124-1 assume !(0 != main_~p11~0#1); 1133#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1131#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1129#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1125#L140-1 assume !(0 != main_~p1~0#1); 1123#L146-1 assume !(0 != main_~p2~0#1); 1121#L151-1 assume !(0 != main_~p3~0#1); 1116#L156-1 assume !(0 != main_~p4~0#1); 1114#L161-1 assume !(0 != main_~p5~0#1); 1108#L166-1 assume !(0 != main_~p6~0#1); 1103#L171-1 assume !(0 != main_~p7~0#1); 1100#L176-1 assume !(0 != main_~p8~0#1); 1098#L181-1 assume !(0 != main_~p9~0#1); 1095#L186-1 assume !(0 != main_~p10~0#1); 1092#L191-1 assume !(0 != main_~p11~0#1); 1088#L196-1 assume !(0 != main_~p12~0#1); 1068#L201-1 assume !(0 != main_~p13~0#1); 1038#L206-1 assume !(0 != main_~p14~0#1); 968#L211-1 [2022-10-17 10:41:28,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:28,783 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-10-17 10:41:28,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:28,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289848278] [2022-10-17 10:41:28,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:28,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:28,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:41:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:28,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:41:28,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:28,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1519232837, now seen corresponding path program 1 times [2022-10-17 10:41:28,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:28,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97041555] [2022-10-17 10:41:28,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:28,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:28,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:28,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97041555] [2022-10-17 10:41:28,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97041555] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:28,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:28,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:41:28,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772453230] [2022-10-17 10:41:28,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:28,882 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:41:28,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:28,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:41:28,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:41:28,883 INFO L87 Difference]: Start difference. First operand 342 states and 542 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-10-17 10:41:28,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:28,917 INFO L93 Difference]: Finished difference Result 674 states and 1058 transitions. [2022-10-17 10:41:28,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 1058 transitions. [2022-10-17 10:41:28,927 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2022-10-17 10:41:28,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 674 states and 1058 transitions. [2022-10-17 10:41:28,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2022-10-17 10:41:28,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2022-10-17 10:41:28,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 674 states and 1058 transitions. [2022-10-17 10:41:28,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:41:28,952 INFO L218 hiAutomatonCegarLoop]: Abstraction has 674 states and 1058 transitions. [2022-10-17 10:41:28,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states and 1058 transitions. [2022-10-17 10:41:28,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2022-10-17 10:41:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 674 states have (on average 1.5697329376854599) internal successors, (1058), 673 states have internal predecessors, (1058), 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) [2022-10-17 10:41:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1058 transitions. [2022-10-17 10:41:29,013 INFO L240 hiAutomatonCegarLoop]: Abstraction has 674 states and 1058 transitions. [2022-10-17 10:41:29,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:41:29,014 INFO L428 stractBuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2022-10-17 10:41:29,014 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-10-17 10:41:29,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1058 transitions. [2022-10-17 10:41:29,033 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2022-10-17 10:41:29,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:41:29,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:41:29,035 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:41:29,036 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:41:29,036 INFO L748 eck$LassoCheckResult]: Stem: 2005#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 1986#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 1987#L211-1 [2022-10-17 10:41:29,037 INFO L750 eck$LassoCheckResult]: Loop: 1987#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2105#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 2103#L88 assume !(0 != main_~p1~0#1); 2104#L88-2 assume !(0 != main_~p2~0#1); 2147#L92-1 assume !(0 != main_~p3~0#1); 2145#L96-1 assume !(0 != main_~p4~0#1); 2143#L100-1 assume !(0 != main_~p5~0#1); 2142#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 2141#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2140#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2139#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2138#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2137#L124-1 assume !(0 != main_~p11~0#1); 2136#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2135#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2134#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2132#L140-1 assume !(0 != main_~p1~0#1); 2130#L146-1 assume !(0 != main_~p2~0#1); 2129#L151-1 assume !(0 != main_~p3~0#1); 2126#L156-1 assume !(0 != main_~p4~0#1); 2124#L161-1 assume !(0 != main_~p5~0#1); 2123#L166-1 assume !(0 != main_~p6~0#1); 2120#L171-1 assume !(0 != main_~p7~0#1); 2119#L176-1 assume !(0 != main_~p8~0#1); 2117#L181-1 assume !(0 != main_~p9~0#1); 2114#L186-1 assume !(0 != main_~p10~0#1); 2113#L191-1 assume !(0 != main_~p11~0#1); 2111#L196-1 assume !(0 != main_~p12~0#1); 2109#L201-1 assume !(0 != main_~p13~0#1); 2107#L206-1 assume !(0 != main_~p14~0#1); 1987#L211-1 [2022-10-17 10:41:29,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-10-17 10:41:29,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:29,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214123940] [2022-10-17 10:41:29,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:29,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:29,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:41:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:29,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:41:29,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:29,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1653246343, now seen corresponding path program 1 times [2022-10-17 10:41:29,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:29,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538081283] [2022-10-17 10:41:29,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:29,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:29,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:29,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:29,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538081283] [2022-10-17 10:41:29,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538081283] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:29,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:29,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:41:29,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190233097] [2022-10-17 10:41:29,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:29,152 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:41:29,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:29,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:41:29,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:41:29,154 INFO L87 Difference]: Start difference. First operand 674 states and 1058 transitions. cyclomatic complexity: 400 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-10-17 10:41:29,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:29,177 INFO L93 Difference]: Finished difference Result 1330 states and 2066 transitions. [2022-10-17 10:41:29,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2066 transitions. [2022-10-17 10:41:29,194 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2022-10-17 10:41:29,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 2066 transitions. [2022-10-17 10:41:29,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2022-10-17 10:41:29,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2022-10-17 10:41:29,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 2066 transitions. [2022-10-17 10:41:29,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:41:29,212 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2022-10-17 10:41:29,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 2066 transitions. [2022-10-17 10:41:29,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2022-10-17 10:41:29,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1330 states have (on average 1.5533834586466166) internal successors, (2066), 1329 states have internal predecessors, (2066), 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) [2022-10-17 10:41:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2066 transitions. [2022-10-17 10:41:29,254 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2022-10-17 10:41:29,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:41:29,256 INFO L428 stractBuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2022-10-17 10:41:29,256 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-10-17 10:41:29,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 2066 transitions. [2022-10-17 10:41:29,266 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2022-10-17 10:41:29,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:41:29,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:41:29,267 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:41:29,267 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:41:29,267 INFO L748 eck$LassoCheckResult]: Stem: 4017#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 3996#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 3997#L211-1 [2022-10-17 10:41:29,268 INFO L750 eck$LassoCheckResult]: Loop: 3997#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 4074#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 4061#L88 assume !(0 != main_~p1~0#1); 4054#L88-2 assume !(0 != main_~p2~0#1); 4055#L92-1 assume !(0 != main_~p3~0#1); 4048#L96-1 assume !(0 != main_~p4~0#1); 4050#L100-1 assume !(0 != main_~p5~0#1); 4187#L104-1 assume !(0 != main_~p6~0#1); 4189#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 4179#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4180#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4171#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4172#L124-1 assume !(0 != main_~p11~0#1); 4163#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4164#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4155#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4156#L140-1 assume !(0 != main_~p1~0#1); 4355#L146-1 assume !(0 != main_~p2~0#1); 4353#L151-1 assume !(0 != main_~p3~0#1); 4348#L156-1 assume !(0 != main_~p4~0#1); 4346#L161-1 assume !(0 != main_~p5~0#1); 4345#L166-1 assume !(0 != main_~p6~0#1); 4342#L171-1 assume !(0 != main_~p7~0#1); 4341#L176-1 assume !(0 != main_~p8~0#1); 4338#L181-1 assume !(0 != main_~p9~0#1); 4335#L186-1 assume !(0 != main_~p10~0#1); 4317#L191-1 assume !(0 != main_~p11~0#1); 4289#L196-1 assume !(0 != main_~p12~0#1); 4288#L201-1 assume !(0 != main_~p13~0#1); 4292#L206-1 assume !(0 != main_~p14~0#1); 3997#L211-1 [2022-10-17 10:41:29,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:29,268 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-10-17 10:41:29,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:29,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217049701] [2022-10-17 10:41:29,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:29,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:29,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:41:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:29,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:41:29,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:29,282 INFO L85 PathProgramCache]: Analyzing trace with hash 836282619, now seen corresponding path program 1 times [2022-10-17 10:41:29,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:29,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145581574] [2022-10-17 10:41:29,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:29,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:29,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:29,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145581574] [2022-10-17 10:41:29,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145581574] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:29,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:29,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:41:29,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547177838] [2022-10-17 10:41:29,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:29,326 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:41:29,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:29,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:41:29,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:41:29,327 INFO L87 Difference]: Start difference. First operand 1330 states and 2066 transitions. cyclomatic complexity: 768 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-10-17 10:41:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:29,358 INFO L93 Difference]: Finished difference Result 2626 states and 4034 transitions. [2022-10-17 10:41:29,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 4034 transitions. [2022-10-17 10:41:29,388 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2022-10-17 10:41:29,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 4034 transitions. [2022-10-17 10:41:29,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2022-10-17 10:41:29,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2022-10-17 10:41:29,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 4034 transitions. [2022-10-17 10:41:29,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:41:29,420 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2022-10-17 10:41:29,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 4034 transitions. [2022-10-17 10:41:29,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2022-10-17 10:41:29,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2626 states have (on average 1.5361766945925361) internal successors, (4034), 2625 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:41:29,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4034 transitions. [2022-10-17 10:41:29,519 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2022-10-17 10:41:29,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:41:29,521 INFO L428 stractBuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2022-10-17 10:41:29,521 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-10-17 10:41:29,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 4034 transitions. [2022-10-17 10:41:29,543 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2022-10-17 10:41:29,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:41:29,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:41:29,545 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:41:29,545 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:41:29,546 INFO L748 eck$LassoCheckResult]: Stem: 7974#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 7958#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 7959#L211-1 [2022-10-17 10:41:29,546 INFO L750 eck$LassoCheckResult]: Loop: 7959#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 8097#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 8093#L88 assume !(0 != main_~p1~0#1); 8086#L88-2 assume !(0 != main_~p2~0#1); 8081#L92-1 assume !(0 != main_~p3~0#1); 8074#L96-1 assume !(0 != main_~p4~0#1); 8066#L100-1 assume !(0 != main_~p5~0#1); 8058#L104-1 assume !(0 != main_~p6~0#1); 8052#L108-1 assume !(0 != main_~p7~0#1); 8047#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8048#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8041#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8042#L124-1 assume !(0 != main_~p11~0#1); 8035#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8036#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8028#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8029#L140-1 assume !(0 != main_~p1~0#1); 8194#L146-1 assume !(0 != main_~p2~0#1); 8174#L151-1 assume !(0 != main_~p3~0#1); 8168#L156-1 assume !(0 != main_~p4~0#1); 8163#L161-1 assume !(0 != main_~p5~0#1); 8159#L166-1 assume !(0 != main_~p6~0#1); 8157#L171-1 assume !(0 != main_~p7~0#1); 8156#L176-1 assume !(0 != main_~p8~0#1); 8154#L181-1 assume !(0 != main_~p9~0#1); 8141#L186-1 assume !(0 != main_~p10~0#1); 8122#L191-1 assume !(0 != main_~p11~0#1); 8118#L196-1 assume !(0 != main_~p12~0#1); 8116#L201-1 assume !(0 != main_~p13~0#1); 8106#L206-1 assume !(0 != main_~p14~0#1); 7959#L211-1 [2022-10-17 10:41:29,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:29,549 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-10-17 10:41:29,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:29,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763505736] [2022-10-17 10:41:29,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:29,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:29,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:41:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:29,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:41:29,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:29,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1055137337, now seen corresponding path program 1 times [2022-10-17 10:41:29,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:29,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511635173] [2022-10-17 10:41:29,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:29,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:29,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:29,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511635173] [2022-10-17 10:41:29,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511635173] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:29,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:29,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:41:29,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585629320] [2022-10-17 10:41:29,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:29,609 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:41:29,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:29,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:41:29,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:41:29,610 INFO L87 Difference]: Start difference. First operand 2626 states and 4034 transitions. cyclomatic complexity: 1472 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-10-17 10:41:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:29,649 INFO L93 Difference]: Finished difference Result 5186 states and 7874 transitions. [2022-10-17 10:41:29,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5186 states and 7874 transitions. [2022-10-17 10:41:29,698 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2022-10-17 10:41:29,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5186 states to 5186 states and 7874 transitions. [2022-10-17 10:41:29,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5186 [2022-10-17 10:41:29,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5186 [2022-10-17 10:41:29,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5186 states and 7874 transitions. [2022-10-17 10:41:29,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:41:29,757 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2022-10-17 10:41:29,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states and 7874 transitions. [2022-10-17 10:41:29,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2022-10-17 10:41:29,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5186 states have (on average 1.5183185499421519) internal successors, (7874), 5185 states have internal predecessors, (7874), 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) [2022-10-17 10:41:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7874 transitions. [2022-10-17 10:41:29,951 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2022-10-17 10:41:29,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:41:29,953 INFO L428 stractBuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2022-10-17 10:41:29,954 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-10-17 10:41:29,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5186 states and 7874 transitions. [2022-10-17 10:41:29,988 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2022-10-17 10:41:29,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:41:29,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:41:29,990 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:41:29,990 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:41:29,990 INFO L748 eck$LassoCheckResult]: Stem: 15796#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 15777#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 15778#L211-1 [2022-10-17 10:41:29,991 INFO L750 eck$LassoCheckResult]: Loop: 15778#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 16332#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 16329#L88 assume !(0 != main_~p1~0#1); 16326#L88-2 assume !(0 != main_~p2~0#1); 16324#L92-1 assume !(0 != main_~p3~0#1); 16321#L96-1 assume !(0 != main_~p4~0#1); 16317#L100-1 assume !(0 != main_~p5~0#1); 16314#L104-1 assume !(0 != main_~p6~0#1); 16311#L108-1 assume !(0 != main_~p7~0#1); 16140#L112-1 assume !(0 != main_~p8~0#1); 16142#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 16090#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 16091#L124-1 assume !(0 != main_~p11~0#1); 16082#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 16083#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 16481#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 16477#L140-1 assume !(0 != main_~p1~0#1); 16066#L146-1 assume !(0 != main_~p2~0#1); 16068#L151-1 assume !(0 != main_~p3~0#1); 16057#L156-1 assume !(0 != main_~p4~0#1); 16059#L161-1 assume !(0 != main_~p5~0#1); 16363#L166-1 assume !(0 != main_~p6~0#1); 16361#L171-1 assume !(0 != main_~p7~0#1); 16359#L176-1 assume !(0 != main_~p8~0#1); 16357#L181-1 assume !(0 != main_~p9~0#1); 16352#L186-1 assume !(0 != main_~p10~0#1); 16349#L191-1 assume !(0 != main_~p11~0#1); 16345#L196-1 assume !(0 != main_~p12~0#1); 16341#L201-1 assume !(0 != main_~p13~0#1); 16337#L206-1 assume !(0 != main_~p14~0#1); 15778#L211-1 [2022-10-17 10:41:29,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:29,992 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-10-17 10:41:29,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:29,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433748085] [2022-10-17 10:41:29,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:29,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:29,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:41:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:30,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:41:30,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1477839163, now seen corresponding path program 1 times [2022-10-17 10:41:30,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:30,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542964075] [2022-10-17 10:41:30,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:30,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:30,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:30,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:30,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542964075] [2022-10-17 10:41:30,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542964075] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:30,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:30,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:41:30,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949406792] [2022-10-17 10:41:30,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:30,073 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:41:30,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:30,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:41:30,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:41:30,075 INFO L87 Difference]: Start difference. First operand 5186 states and 7874 transitions. cyclomatic complexity: 2816 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-10-17 10:41:30,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:30,199 INFO L93 Difference]: Finished difference Result 10242 states and 15362 transitions. [2022-10-17 10:41:30,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10242 states and 15362 transitions. [2022-10-17 10:41:30,286 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2022-10-17 10:41:30,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10242 states to 10242 states and 15362 transitions. [2022-10-17 10:41:30,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10242 [2022-10-17 10:41:30,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10242 [2022-10-17 10:41:30,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10242 states and 15362 transitions. [2022-10-17 10:41:30,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:41:30,432 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2022-10-17 10:41:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states and 15362 transitions. [2022-10-17 10:41:30,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10242. [2022-10-17 10:41:30,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10242 states, 10242 states have (on average 1.4999023628197619) internal successors, (15362), 10241 states have internal predecessors, (15362), 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) [2022-10-17 10:41:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 15362 transitions. [2022-10-17 10:41:30,779 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2022-10-17 10:41:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:41:30,784 INFO L428 stractBuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2022-10-17 10:41:30,784 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-10-17 10:41:30,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10242 states and 15362 transitions. [2022-10-17 10:41:30,833 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2022-10-17 10:41:30,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:41:30,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:41:30,833 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:41:30,834 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:41:30,834 INFO L748 eck$LassoCheckResult]: Stem: 31228#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 31211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 31212#L211-1 [2022-10-17 10:41:30,836 INFO L750 eck$LassoCheckResult]: Loop: 31212#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 31931#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 31927#L88 assume !(0 != main_~p1~0#1); 31923#L88-2 assume !(0 != main_~p2~0#1); 31921#L92-1 assume !(0 != main_~p3~0#1); 31917#L96-1 assume !(0 != main_~p4~0#1); 31913#L100-1 assume !(0 != main_~p5~0#1); 31910#L104-1 assume !(0 != main_~p6~0#1); 31911#L108-1 assume !(0 != main_~p7~0#1); 31996#L112-1 assume !(0 != main_~p8~0#1); 31993#L116-1 assume !(0 != main_~p9~0#1); 31991#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 31989#L124-1 assume !(0 != main_~p11~0#1); 31987#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 31985#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 31982#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 31978#L140-1 assume !(0 != main_~p1~0#1); 31974#L146-1 assume !(0 != main_~p2~0#1); 31972#L151-1 assume !(0 != main_~p3~0#1); 31968#L156-1 assume !(0 != main_~p4~0#1); 31965#L161-1 assume !(0 != main_~p5~0#1); 31964#L166-1 assume !(0 != main_~p6~0#1); 31962#L171-1 assume !(0 != main_~p7~0#1); 31958#L176-1 assume !(0 != main_~p8~0#1); 31954#L181-1 assume !(0 != main_~p9~0#1); 31950#L186-1 assume !(0 != main_~p10~0#1); 31947#L191-1 assume !(0 != main_~p11~0#1); 31943#L196-1 assume !(0 != main_~p12~0#1); 31939#L201-1 assume !(0 != main_~p13~0#1); 31935#L206-1 assume !(0 != main_~p14~0#1); 31212#L211-1 [2022-10-17 10:41:30,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:30,836 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-10-17 10:41:30,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:30,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661268407] [2022-10-17 10:41:30,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:30,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:30,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:41:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:30,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:41:30,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:30,858 INFO L85 PathProgramCache]: Analyzing trace with hash 660190713, now seen corresponding path program 1 times [2022-10-17 10:41:30,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:30,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253916991] [2022-10-17 10:41:30,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:30,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:30,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:30,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253916991] [2022-10-17 10:41:30,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253916991] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:30,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:30,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:41:30,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913256427] [2022-10-17 10:41:30,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:30,914 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:41:30,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:30,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:41:30,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:41:30,915 INFO L87 Difference]: Start difference. First operand 10242 states and 15362 transitions. cyclomatic complexity: 5376 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-10-17 10:41:31,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:31,103 INFO L93 Difference]: Finished difference Result 20226 states and 29954 transitions. [2022-10-17 10:41:31,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20226 states and 29954 transitions. [2022-10-17 10:41:31,343 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2022-10-17 10:41:31,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20226 states to 20226 states and 29954 transitions. [2022-10-17 10:41:31,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20226 [2022-10-17 10:41:31,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20226 [2022-10-17 10:41:31,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20226 states and 29954 transitions. [2022-10-17 10:41:31,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:41:31,545 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2022-10-17 10:41:31,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states and 29954 transitions. [2022-10-17 10:41:32,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20226. [2022-10-17 10:41:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20226 states, 20226 states have (on average 1.4809650944329082) internal successors, (29954), 20225 states have internal predecessors, (29954), 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) [2022-10-17 10:41:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 29954 transitions. [2022-10-17 10:41:32,205 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2022-10-17 10:41:32,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:41:32,206 INFO L428 stractBuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2022-10-17 10:41:32,206 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-10-17 10:41:32,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20226 states and 29954 transitions. [2022-10-17 10:41:32,273 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2022-10-17 10:41:32,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:41:32,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:41:32,274 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:41:32,274 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:41:32,274 INFO L748 eck$LassoCheckResult]: Stem: 61703#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 61684#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 61685#L211-1 [2022-10-17 10:41:32,274 INFO L750 eck$LassoCheckResult]: Loop: 61685#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 62023#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 62020#L88 assume !(0 != main_~p1~0#1); 62016#L88-2 assume !(0 != main_~p2~0#1); 62013#L92-1 assume !(0 != main_~p3~0#1); 62010#L96-1 assume !(0 != main_~p4~0#1); 62006#L100-1 assume !(0 != main_~p5~0#1); 62002#L104-1 assume !(0 != main_~p6~0#1); 61995#L108-1 assume !(0 != main_~p7~0#1); 61996#L112-1 assume !(0 != main_~p8~0#1); 62085#L116-1 assume !(0 != main_~p9~0#1); 62081#L120-1 assume !(0 != main_~p10~0#1); 62079#L124-1 assume !(0 != main_~p11~0#1); 62077#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 62075#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 62073#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 62069#L140-1 assume !(0 != main_~p1~0#1); 62065#L146-1 assume !(0 != main_~p2~0#1); 62062#L151-1 assume !(0 != main_~p3~0#1); 62057#L156-1 assume !(0 != main_~p4~0#1); 62053#L161-1 assume !(0 != main_~p5~0#1); 62049#L166-1 assume !(0 != main_~p6~0#1); 62047#L171-1 assume !(0 != main_~p7~0#1); 62045#L176-1 assume !(0 != main_~p8~0#1); 62043#L181-1 assume !(0 != main_~p9~0#1); 62041#L186-1 assume !(0 != main_~p10~0#1); 62040#L191-1 assume !(0 != main_~p11~0#1); 62036#L196-1 assume !(0 != main_~p12~0#1); 62032#L201-1 assume !(0 != main_~p13~0#1); 62028#L206-1 assume !(0 != main_~p14~0#1); 61685#L211-1 [2022-10-17 10:41:32,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:32,275 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-10-17 10:41:32,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:32,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827422909] [2022-10-17 10:41:32,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:32,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:32,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:41:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:32,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:41:32,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:32,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1028753029, now seen corresponding path program 1 times [2022-10-17 10:41:32,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:32,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192557099] [2022-10-17 10:41:32,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:32,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:32,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:32,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:32,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192557099] [2022-10-17 10:41:32,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192557099] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:32,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:32,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:41:32,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075459697] [2022-10-17 10:41:32,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:32,319 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:41:32,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:32,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:41:32,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:41:32,324 INFO L87 Difference]: Start difference. First operand 20226 states and 29954 transitions. cyclomatic complexity: 10240 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-10-17 10:41:32,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:32,621 INFO L93 Difference]: Finished difference Result 39938 states and 58370 transitions. [2022-10-17 10:41:32,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39938 states and 58370 transitions. [2022-10-17 10:41:32,801 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2022-10-17 10:41:33,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39938 states to 39938 states and 58370 transitions. [2022-10-17 10:41:33,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39938 [2022-10-17 10:41:33,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39938 [2022-10-17 10:41:33,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39938 states and 58370 transitions. [2022-10-17 10:41:33,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:41:33,141 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2022-10-17 10:41:33,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states and 58370 transitions. [2022-10-17 10:41:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 39938. [2022-10-17 10:41:33,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39938 states, 39938 states have (on average 1.4615153487906254) internal successors, (58370), 39937 states have internal predecessors, (58370), 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) [2022-10-17 10:41:34,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39938 states to 39938 states and 58370 transitions. [2022-10-17 10:41:34,065 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2022-10-17 10:41:34,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:41:34,067 INFO L428 stractBuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2022-10-17 10:41:34,067 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-10-17 10:41:34,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39938 states and 58370 transitions. [2022-10-17 10:41:34,184 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2022-10-17 10:41:34,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:41:34,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:41:34,185 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:41:34,185 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:41:34,185 INFO L748 eck$LassoCheckResult]: Stem: 121875#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 121856#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 121857#L211-1 [2022-10-17 10:41:34,185 INFO L750 eck$LassoCheckResult]: Loop: 121857#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 122012#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 122010#L88 assume !(0 != main_~p1~0#1); 122006#L88-2 assume !(0 != main_~p2~0#1); 122004#L92-1 assume !(0 != main_~p3~0#1); 122000#L96-1 assume !(0 != main_~p4~0#1); 121996#L100-1 assume !(0 != main_~p5~0#1); 121992#L104-1 assume !(0 != main_~p6~0#1); 121988#L108-1 assume !(0 != main_~p7~0#1); 121984#L112-1 assume !(0 != main_~p8~0#1); 121980#L116-1 assume !(0 != main_~p9~0#1); 121976#L120-1 assume !(0 != main_~p10~0#1); 121974#L124-1 assume !(0 != main_~p11~0#1); 121970#L128-1 assume !(0 != main_~p12~0#1); 121968#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 121966#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 121963#L140-1 assume !(0 != main_~p1~0#1); 121964#L146-1 assume !(0 != main_~p2~0#1); 122060#L151-1 assume !(0 != main_~p3~0#1); 122055#L156-1 assume !(0 != main_~p4~0#1); 122051#L161-1 assume !(0 != main_~p5~0#1); 122047#L166-1 assume !(0 != main_~p6~0#1); 122043#L171-1 assume !(0 != main_~p7~0#1); 122039#L176-1 assume !(0 != main_~p8~0#1); 122035#L181-1 assume !(0 != main_~p9~0#1); 122031#L186-1 assume !(0 != main_~p10~0#1); 122028#L191-1 assume !(0 != main_~p11~0#1); 122023#L196-1 assume !(0 != main_~p12~0#1); 122020#L201-1 assume !(0 != main_~p13~0#1); 122016#L206-1 assume !(0 != main_~p14~0#1); 121857#L211-1 [2022-10-17 10:41:34,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:34,186 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2022-10-17 10:41:34,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:34,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882998991] [2022-10-17 10:41:34,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:34,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:34,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:41:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:34,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:41:34,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:34,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1677866365, now seen corresponding path program 1 times [2022-10-17 10:41:34,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:34,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80746807] [2022-10-17 10:41:34,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:34,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:34,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:34,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80746807] [2022-10-17 10:41:34,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80746807] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:34,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:34,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:41:34,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596273873] [2022-10-17 10:41:34,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:34,359 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:41:34,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:34,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:41:34,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:41:34,360 INFO L87 Difference]: Start difference. First operand 39938 states and 58370 transitions. cyclomatic complexity: 19456 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-10-17 10:41:34,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:34,570 INFO L93 Difference]: Finished difference Result 78850 states and 113666 transitions. [2022-10-17 10:41:34,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78850 states and 113666 transitions. [2022-10-17 10:41:35,109 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2022-10-17 10:41:35,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78850 states to 78850 states and 113666 transitions. [2022-10-17 10:41:35,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78850 [2022-10-17 10:41:35,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78850 [2022-10-17 10:41:35,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78850 states and 113666 transitions. [2022-10-17 10:41:35,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:41:35,628 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2022-10-17 10:41:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78850 states and 113666 transitions. [2022-10-17 10:41:36,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78850 to 78850. [2022-10-17 10:41:36,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78850 states, 78850 states have (on average 1.4415472415979709) internal successors, (113666), 78849 states have internal predecessors, (113666), 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) [2022-10-17 10:41:37,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78850 states to 78850 states and 113666 transitions. [2022-10-17 10:41:37,177 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2022-10-17 10:41:37,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:41:37,178 INFO L428 stractBuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2022-10-17 10:41:37,179 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-10-17 10:41:37,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78850 states and 113666 transitions. [2022-10-17 10:41:37,388 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2022-10-17 10:41:37,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:41:37,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:41:37,390 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:41:37,390 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:41:37,390 INFO L748 eck$LassoCheckResult]: Stem: 240669#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 240648#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 240649#L211-1 [2022-10-17 10:41:37,391 INFO L750 eck$LassoCheckResult]: Loop: 240649#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 241123#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 241119#L88 assume !(0 != main_~p1~0#1); 241113#L88-2 assume !(0 != main_~p2~0#1); 241108#L92-1 assume !(0 != main_~p3~0#1); 241104#L96-1 assume !(0 != main_~p4~0#1); 241098#L100-1 assume !(0 != main_~p5~0#1); 241068#L104-1 assume !(0 != main_~p6~0#1); 241070#L108-1 assume !(0 != main_~p7~0#1); 241092#L112-1 assume !(0 != main_~p8~0#1); 241206#L116-1 assume !(0 != main_~p9~0#1); 241203#L120-1 assume !(0 != main_~p10~0#1); 241200#L124-1 assume !(0 != main_~p11~0#1); 241197#L128-1 assume !(0 != main_~p12~0#1); 241193#L132-1 assume !(0 != main_~p13~0#1); 241194#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 241224#L140-1 assume !(0 != main_~p1~0#1); 241222#L146-1 assume !(0 != main_~p2~0#1); 241221#L151-1 assume !(0 != main_~p3~0#1); 241218#L156-1 assume !(0 != main_~p4~0#1); 241216#L161-1 assume !(0 != main_~p5~0#1); 241214#L166-1 assume !(0 != main_~p6~0#1); 241007#L171-1 assume !(0 != main_~p7~0#1); 241002#L176-1 assume !(0 != main_~p8~0#1); 240997#L181-1 assume !(0 != main_~p9~0#1); 240992#L186-1 assume !(0 != main_~p10~0#1); 240993#L191-1 assume !(0 != main_~p11~0#1); 240982#L196-1 assume !(0 != main_~p12~0#1); 240984#L201-1 assume !(0 != main_~p13~0#1); 241131#L206-1 assume !(0 != main_~p14~0#1); 240649#L211-1 [2022-10-17 10:41:37,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:37,391 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2022-10-17 10:41:37,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:37,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925847598] [2022-10-17 10:41:37,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:37,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:37,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:41:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:37,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:41:37,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:37,403 INFO L85 PathProgramCache]: Analyzing trace with hash 656798011, now seen corresponding path program 1 times [2022-10-17 10:41:37,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:37,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081517211] [2022-10-17 10:41:37,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:37,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:37,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:37,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081517211] [2022-10-17 10:41:37,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081517211] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:37,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:37,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:41:37,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009120175] [2022-10-17 10:41:37,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:37,429 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:41:37,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:37,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:41:37,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:41:37,430 INFO L87 Difference]: Start difference. First operand 78850 states and 113666 transitions. cyclomatic complexity: 36864 Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-10-17 10:41:37,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:37,825 INFO L93 Difference]: Finished difference Result 155650 states and 221186 transitions. [2022-10-17 10:41:37,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155650 states and 221186 transitions. [2022-10-17 10:41:38,861 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2022-10-17 10:41:39,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155650 states to 155650 states and 221186 transitions. [2022-10-17 10:41:39,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155650 [2022-10-17 10:41:39,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155650 [2022-10-17 10:41:39,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155650 states and 221186 transitions. [2022-10-17 10:41:40,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:41:40,142 INFO L218 hiAutomatonCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2022-10-17 10:41:40,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155650 states and 221186 transitions. [2022-10-17 10:41:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155650 to 155650. [2022-10-17 10:41:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155650 states, 155650 states have (on average 1.4210472213299068) internal successors, (221186), 155649 states have internal predecessors, (221186), 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) [2022-10-17 10:41:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155650 states to 155650 states and 221186 transitions. [2022-10-17 10:41:42,460 INFO L240 hiAutomatonCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2022-10-17 10:41:42,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:41:42,461 INFO L428 stractBuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2022-10-17 10:41:42,461 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-10-17 10:41:42,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155650 states and 221186 transitions. [2022-10-17 10:41:42,899 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2022-10-17 10:41:42,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:41:42,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:41:42,901 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:41:42,901 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:41:42,902 INFO L748 eck$LassoCheckResult]: Stem: 475174#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 475155#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 475156#L211-1 [2022-10-17 10:41:42,902 INFO L750 eck$LassoCheckResult]: Loop: 475156#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 476630#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 476626#L88 assume !(0 != main_~p1~0#1); 476622#L88-2 assume !(0 != main_~p2~0#1); 476620#L92-1 assume !(0 != main_~p3~0#1); 476615#L96-1 assume !(0 != main_~p4~0#1); 476603#L100-1 assume !(0 != main_~p5~0#1); 476604#L104-1 assume !(0 != main_~p6~0#1); 476674#L108-1 assume !(0 != main_~p7~0#1); 476661#L112-1 assume !(0 != main_~p8~0#1); 476659#L116-1 assume !(0 != main_~p9~0#1); 476569#L120-1 assume !(0 != main_~p10~0#1); 476571#L124-1 assume !(0 != main_~p11~0#1); 476544#L128-1 assume !(0 != main_~p12~0#1); 476546#L132-1 assume !(0 != main_~p13~0#1); 476521#L136-1 assume !(0 != main_~p14~0#1); 476523#L140-1 assume !(0 != main_~p1~0#1); 476485#L146-1 assume !(0 != main_~p2~0#1); 476487#L151-1 assume !(0 != main_~p3~0#1); 476475#L156-1 assume !(0 != main_~p4~0#1); 476477#L161-1 assume !(0 != main_~p5~0#1); 476335#L166-1 assume !(0 != main_~p6~0#1); 476336#L171-1 assume !(0 != main_~p7~0#1); 476428#L176-1 assume !(0 != main_~p8~0#1); 476650#L181-1 assume !(0 != main_~p9~0#1); 476647#L186-1 assume !(0 != main_~p10~0#1); 476646#L191-1 assume !(0 != main_~p11~0#1); 476643#L196-1 assume !(0 != main_~p12~0#1); 476639#L201-1 assume !(0 != main_~p13~0#1); 476635#L206-1 assume !(0 != main_~p14~0#1); 475156#L211-1 [2022-10-17 10:41:42,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:42,903 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2022-10-17 10:41:42,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:42,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35577015] [2022-10-17 10:41:42,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:42,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:42,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:41:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:42,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:41:42,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:42,913 INFO L85 PathProgramCache]: Analyzing trace with hash -623065667, now seen corresponding path program 1 times [2022-10-17 10:41:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:42,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243763719] [2022-10-17 10:41:42,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:42,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:42,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:41:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:42,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:41:42,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:42,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1839024639, now seen corresponding path program 1 times [2022-10-17 10:41:42,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:42,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74840237] [2022-10-17 10:41:42,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:42,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:42,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:41:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:42,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:41:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:43,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:41:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:41:43,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.10 10:41:43 BoogieIcfgContainer [2022-10-17 10:41:43,594 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-10-17 10:41:43,595 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 10:41:43,595 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 10:41:43,595 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 10:41:43,596 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:41:27" (3/4) ... [2022-10-17 10:41:43,598 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-10-17 10:41:43,652 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/bin/uautomizer-J5u9QxTXDZ/witness.graphml [2022-10-17 10:41:43,652 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 10:41:43,653 INFO L158 Benchmark]: Toolchain (without parser) took 16845.04ms. Allocated memory was 104.9MB in the beginning and 11.2GB in the end (delta: 11.1GB). Free memory was 64.1MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-10-17 10:41:43,653 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 104.9MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 10:41:43,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.74ms. Allocated memory is still 104.9MB. Free memory was 63.9MB in the beginning and 78.4MB in the end (delta: -14.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-10-17 10:41:43,654 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.87ms. Allocated memory is still 104.9MB. Free memory was 78.4MB in the beginning and 76.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:41:43,654 INFO L158 Benchmark]: Boogie Preprocessor took 43.56ms. Allocated memory is still 104.9MB. Free memory was 76.7MB in the beginning and 75.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:41:43,655 INFO L158 Benchmark]: RCFGBuilder took 442.09ms. Allocated memory is still 104.9MB. Free memory was 75.0MB in the beginning and 61.1MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-10-17 10:41:43,655 INFO L158 Benchmark]: BuchiAutomizer took 15922.51ms. Allocated memory was 104.9MB in the beginning and 11.2GB in the end (delta: 11.1GB). Free memory was 60.7MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-10-17 10:41:43,656 INFO L158 Benchmark]: Witness Printer took 57.36ms. Allocated memory is still 11.2GB. Free memory was 9.7GB in the beginning and 9.7GB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:41:43,658 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.30ms. Allocated memory is still 104.9MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.74ms. Allocated memory is still 104.9MB. Free memory was 63.9MB in the beginning and 78.4MB in the end (delta: -14.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.87ms. Allocated memory is still 104.9MB. Free memory was 78.4MB in the beginning and 76.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.56ms. Allocated memory is still 104.9MB. Free memory was 76.7MB in the beginning and 75.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 442.09ms. Allocated memory is still 104.9MB. Free memory was 75.0MB in the beginning and 61.1MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 15922.51ms. Allocated memory was 104.9MB in the beginning and 11.2GB in the end (delta: 11.1GB). Free memory was 60.7MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 57.36ms. Allocated memory is still 11.2GB. Free memory was 9.7GB in the beginning and 9.7GB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (12 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.12 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 155650 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.8s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 12.6s. Highest rank in rank-based complementation 0. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 6.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 4.2s Buchi closure took 0.1s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 690 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 690 mSDsluCounter, 2157 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 833 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60 IncrementalHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 1324 mSDtfsCounter, 60 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI12 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 53]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; Loop: [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND FALSE !(p2 != 0) [L96] COND FALSE !(p3 != 0) [L100] COND FALSE !(p4 != 0) [L104] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L112] COND FALSE !(p7 != 0) [L116] COND FALSE !(p8 != 0) [L120] COND FALSE !(p9 != 0) [L124] COND FALSE !(p10 != 0) [L128] COND FALSE !(p11 != 0) [L132] COND FALSE !(p12 != 0) [L136] COND FALSE !(p13 != 0) [L140] COND FALSE !(p14 != 0) [L146] COND FALSE !(p1 != 0) [L151] COND FALSE !(p2 != 0) [L156] COND FALSE !(p3 != 0) [L161] COND FALSE !(p4 != 0) [L166] COND FALSE !(p5 != 0) [L171] COND FALSE !(p6 != 0) [L176] COND FALSE !(p7 != 0) [L181] COND FALSE !(p8 != 0) [L186] COND FALSE !(p9 != 0) [L191] COND FALSE !(p10 != 0) [L196] COND FALSE !(p11 != 0) [L201] COND FALSE !(p12 != 0) [L206] COND FALSE !(p13 != 0) [L211] COND FALSE !(p14 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 53]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; Loop: [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND FALSE !(p2 != 0) [L96] COND FALSE !(p3 != 0) [L100] COND FALSE !(p4 != 0) [L104] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L112] COND FALSE !(p7 != 0) [L116] COND FALSE !(p8 != 0) [L120] COND FALSE !(p9 != 0) [L124] COND FALSE !(p10 != 0) [L128] COND FALSE !(p11 != 0) [L132] COND FALSE !(p12 != 0) [L136] COND FALSE !(p13 != 0) [L140] COND FALSE !(p14 != 0) [L146] COND FALSE !(p1 != 0) [L151] COND FALSE !(p2 != 0) [L156] COND FALSE !(p3 != 0) [L161] COND FALSE !(p4 != 0) [L166] COND FALSE !(p5 != 0) [L171] COND FALSE !(p6 != 0) [L176] COND FALSE !(p7 != 0) [L181] COND FALSE !(p8 != 0) [L186] COND FALSE !(p9 != 0) [L191] COND FALSE !(p10 != 0) [L196] COND FALSE !(p11 != 0) [L201] COND FALSE !(p12 != 0) [L206] COND FALSE !(p13 != 0) [L211] COND FALSE !(p14 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-10-17 10:41:43,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9aa0ad-1a89-402d-bd5e-ef72638885ff/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)