./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_10.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_b5a20fd2-845f-415d-a35e-9c5bd637ded6/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5a20fd2-845f-415d-a35e-9c5bd637ded6/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_b5a20fd2-845f-415d-a35e-9c5bd637ded6/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5a20fd2-845f-415d-a35e-9c5bd637ded6/bin/uautomizer-J5u9QxTXDZ/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5a20fd2-845f-415d-a35e-9c5bd637ded6/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_b5a20fd2-845f-415d-a35e-9c5bd637ded6/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 c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b --- 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:42:45,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:42:45,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:42:46,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:42:46,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:42:46,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:42:46,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:42:46,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:42:46,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:42:46,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:42:46,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:42:46,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:42:46,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:42:46,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:42:46,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:42:46,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:42:46,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:42:46,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:42:46,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:42:46,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:42:46,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:42:46,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:42:46,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:42:46,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:42:46,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:42:46,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:42:46,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:42:46,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:42:46,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:42:46,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:42:46,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:42:46,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:42:46,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:42:46,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:42:46,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:42:46,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:42:46,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:42:46,066 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:42:46,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:42:46,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:42:46,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:42:46,074 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5a20fd2-845f-415d-a35e-9c5bd637ded6/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-10-17 10:42:46,126 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:42:46,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:42:46,127 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:42:46,127 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:42:46,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:42:46,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:42:46,129 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:42:46,129 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-10-17 10:42:46,130 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-10-17 10:42:46,130 INFO L138 SettingsManager]: * Use old map elimination=false [2022-10-17 10:42:46,131 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-10-17 10:42:46,131 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-10-17 10:42:46,132 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-10-17 10:42:46,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:42:46,132 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:42:46,132 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-17 10:42:46,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:42:46,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:42:46,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:42:46,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-10-17 10:42:46,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-10-17 10:42:46,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-10-17 10:42:46,134 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:42:46,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 10:42:46,134 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-10-17 10:42:46,134 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:42:46,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-10-17 10:42:46,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:42:46,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:42:46,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:42:46,135 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:42:46,137 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-10-17 10:42:46,137 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_b5a20fd2-845f-415d-a35e-9c5bd637ded6/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_b5a20fd2-845f-415d-a35e-9c5bd637ded6/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 -> c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b [2022-10-17 10:42:46,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:42:46,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:42:46,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:42:46,445 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:42:46,446 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:42:46,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5a20fd2-845f-415d-a35e-9c5bd637ded6/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/locks/test_locks_10.c [2022-10-17 10:42:46,519 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5a20fd2-845f-415d-a35e-9c5bd637ded6/bin/uautomizer-J5u9QxTXDZ/data/bd0824614/1c3f4516d56a4db589df7cc3bc2c5976/FLAG4f5dfacd0 [2022-10-17 10:42:46,973 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:42:46,974 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5a20fd2-845f-415d-a35e-9c5bd637ded6/sv-benchmarks/c/locks/test_locks_10.c [2022-10-17 10:42:46,989 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5a20fd2-845f-415d-a35e-9c5bd637ded6/bin/uautomizer-J5u9QxTXDZ/data/bd0824614/1c3f4516d56a4db589df7cc3bc2c5976/FLAG4f5dfacd0 [2022-10-17 10:42:47,339 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5a20fd2-845f-415d-a35e-9c5bd637ded6/bin/uautomizer-J5u9QxTXDZ/data/bd0824614/1c3f4516d56a4db589df7cc3bc2c5976 [2022-10-17 10:42:47,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:42:47,343 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:42:47,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:42:47,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:42:47,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:42:47,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:42:47" (1/1) ... [2022-10-17 10:42:47,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6988eaa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:42:47, skipping insertion in model container [2022-10-17 10:42:47,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:42:47" (1/1) ... [2022-10-17 10:42:47,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:42:47,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:42:47,587 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_b5a20fd2-845f-415d-a35e-9c5bd637ded6/sv-benchmarks/c/locks/test_locks_10.c[3901,3914] [2022-10-17 10:42:47,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:42:47,601 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:42:47,624 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_b5a20fd2-845f-415d-a35e-9c5bd637ded6/sv-benchmarks/c/locks/test_locks_10.c[3901,3914] [2022-10-17 10:42:47,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:42:47,638 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:42:47,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:42:47 WrapperNode [2022-10-17 10:42:47,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:42:47,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:42:47,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:42:47,641 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:42:47,648 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:42:47" (1/1) ... [2022-10-17 10:42:47,656 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:42:47" (1/1) ... [2022-10-17 10:42:47,676 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2022-10-17 10:42:47,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:42:47,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:42:47,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:42:47,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:42:47,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:42:47" (1/1) ... [2022-10-17 10:42:47,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:42:47" (1/1) ... [2022-10-17 10:42:47,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:42:47" (1/1) ... [2022-10-17 10:42:47,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:42:47" (1/1) ... [2022-10-17 10:42:47,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:42:47" (1/1) ... [2022-10-17 10:42:47,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:42:47" (1/1) ... [2022-10-17 10:42:47,699 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:42:47" (1/1) ... [2022-10-17 10:42:47,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:42:47" (1/1) ... [2022-10-17 10:42:47,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:42:47,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:42:47,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:42:47,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:42:47,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:42:47" (1/1) ... [2022-10-17 10:42:47,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:42:47,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5a20fd2-845f-415d-a35e-9c5bd637ded6/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:42:47,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5a20fd2-845f-415d-a35e-9c5bd637ded6/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-10-17 10:42:47,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5a20fd2-845f-415d-a35e-9c5bd637ded6/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-10-17 10:42:47,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:42:47,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:42:47,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:42:47,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:42:47,880 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:42:47,882 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:42:48,087 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:42:48,095 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:42:48,095 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-17 10:42:48,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:42:48 BoogieIcfgContainer [2022-10-17 10:42:48,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:42:48,099 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-10-17 10:42:48,099 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-10-17 10:42:48,104 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-10-17 10:42:48,105 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-10-17 10:42:48,105 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.10 10:42:47" (1/3) ... [2022-10-17 10:42:48,106 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17ef3c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.10 10:42:48, skipping insertion in model container [2022-10-17 10:42:48,106 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-10-17 10:42:48,107 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:42:47" (2/3) ... [2022-10-17 10:42:48,107 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17ef3c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.10 10:42:48, skipping insertion in model container [2022-10-17 10:42:48,107 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-10-17 10:42:48,108 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:42:48" (3/3) ... [2022-10-17 10:42:48,109 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_10.c [2022-10-17 10:42:48,179 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-10-17 10:42:48,179 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-10-17 10:42:48,180 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-10-17 10:42:48,180 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-10-17 10:42:48,180 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-10-17 10:42:48,180 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-10-17 10:42:48,180 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-10-17 10:42:48,181 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-10-17 10:42:48,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 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:42:48,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-10-17 10:42:48,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:42:48,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:42:48,213 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:42:48,213 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] [2022-10-17 10:42:48,213 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-10-17 10:42:48,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 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:42:48,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-10-17 10:42:48,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:42:48,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:42:48,218 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:42:48,218 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] [2022-10-17 10:42:48,226 INFO L748 eck$LassoCheckResult]: Stem: 23#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(16, 2);call #Ultimate.allocInit(12, 3); 8#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_~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_~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;havoc main_~cond~0#1; 29#L155-1true [2022-10-17 10:42:48,227 INFO L750 eck$LassoCheckResult]: Loop: 29#L155-1true assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 26#L43true 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; 30#L68true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 9#L68-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 3#L72-1true assume !(0 != main_~p3~0#1); 18#L76-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 17#L80-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 31#L84-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 19#L88-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 6#L92-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4#L96-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 7#L100-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 38#L104-1true assume !(0 != main_~p1~0#1); 24#L110-1true assume !(0 != main_~p2~0#1); 33#L115-1true assume !(0 != main_~p3~0#1); 16#L120-1true assume !(0 != main_~p4~0#1); 28#L125-1true assume !(0 != main_~p5~0#1); 35#L130-1true assume !(0 != main_~p6~0#1); 15#L135-1true assume !(0 != main_~p7~0#1); 13#L140-1true assume !(0 != main_~p8~0#1); 39#L145-1true assume !(0 != main_~p9~0#1); 10#L150-1true assume !(0 != main_~p10~0#1); 29#L155-1true [2022-10-17 10:42:48,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:48,234 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-10-17 10:42:48,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:48,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438723375] [2022-10-17 10:42:48,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:48,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:48,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:42:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:48,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:42:48,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:48,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1693159719, now seen corresponding path program 1 times [2022-10-17 10:42:48,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:48,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051509142] [2022-10-17 10:42:48,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:48,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:42:48,502 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:42:48,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:42:48,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051509142] [2022-10-17 10:42:48,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051509142] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:42:48,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:42:48,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:42:48,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214260367] [2022-10-17 10:42:48,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:42:48,510 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:42:48,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:42:48,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:42:48,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:42:48,551 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 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 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:42:48,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:42:48,589 INFO L93 Difference]: Finished difference Result 75 states and 130 transitions. [2022-10-17 10:42:48,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 130 transitions. [2022-10-17 10:42:48,595 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2022-10-17 10:42:48,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 65 states and 103 transitions. [2022-10-17 10:42:48,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2022-10-17 10:42:48,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2022-10-17 10:42:48,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 103 transitions. [2022-10-17 10:42:48,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:42:48,605 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 103 transitions. [2022-10-17 10:42:48,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 103 transitions. [2022-10-17 10:42:48,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-10-17 10:42:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 64 states have internal predecessors, (103), 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:42:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 103 transitions. [2022-10-17 10:42:48,686 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 103 transitions. [2022-10-17 10:42:48,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:42:48,692 INFO L428 stractBuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2022-10-17 10:42:48,692 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-10-17 10:42:48,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 103 transitions. [2022-10-17 10:42:48,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2022-10-17 10:42:48,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:42:48,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:42:48,697 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:42:48,697 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] [2022-10-17 10:42:48,698 INFO L748 eck$LassoCheckResult]: Stem: 150#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(16, 2);call #Ultimate.allocInit(12, 3); 132#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_~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_~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;havoc main_~cond~0#1; 133#L155-1 [2022-10-17 10:42:48,698 INFO L750 eck$LassoCheckResult]: Loop: 133#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 154#L43 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; 155#L68 assume !(0 != main_~p1~0#1); 134#L68-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 123#L72-1 assume !(0 != main_~p3~0#1); 124#L76-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 145#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 146#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 167#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 166#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 125#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 126#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 131#L104-1 assume !(0 != main_~p1~0#1); 151#L110-1 assume !(0 != main_~p2~0#1); 152#L115-1 assume !(0 != main_~p3~0#1); 144#L120-1 assume !(0 != main_~p4~0#1); 128#L125-1 assume !(0 != main_~p5~0#1); 138#L130-1 assume !(0 != main_~p6~0#1); 143#L135-1 assume !(0 != main_~p7~0#1); 139#L140-1 assume !(0 != main_~p8~0#1); 140#L145-1 assume !(0 != main_~p9~0#1); 135#L150-1 assume !(0 != main_~p10~0#1); 133#L155-1 [2022-10-17 10:42:48,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:48,699 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-10-17 10:42:48,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:48,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92691269] [2022-10-17 10:42:48,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:48,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:48,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:42:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:48,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:42:48,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:48,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1784159127, now seen corresponding path program 1 times [2022-10-17 10:42:48,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:48,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298358650] [2022-10-17 10:42:48,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:48,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:42:48,865 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:42:48,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:42:48,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298358650] [2022-10-17 10:42:48,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298358650] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:42:48,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:42:48,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:42:48,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263952009] [2022-10-17 10:42:48,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:42:48,868 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:42:48,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:42:48,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:42:48,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:42:48,869 INFO L87 Difference]: Start difference. First operand 65 states and 103 transitions. cyclomatic complexity: 40 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:42:48,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:42:48,915 INFO L93 Difference]: Finished difference Result 126 states and 198 transitions. [2022-10-17 10:42:48,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 198 transitions. [2022-10-17 10:42:48,924 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2022-10-17 10:42:48,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 198 transitions. [2022-10-17 10:42:48,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2022-10-17 10:42:48,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2022-10-17 10:42:48,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 198 transitions. [2022-10-17 10:42:48,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:42:48,936 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 198 transitions. [2022-10-17 10:42:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 198 transitions. [2022-10-17 10:42:48,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-10-17 10:42:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.5714285714285714) internal successors, (198), 125 states have internal predecessors, (198), 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:42:48,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2022-10-17 10:42:48,950 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 198 transitions. [2022-10-17 10:42:48,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:42:48,956 INFO L428 stractBuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2022-10-17 10:42:48,956 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-10-17 10:42:48,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 198 transitions. [2022-10-17 10:42:48,959 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2022-10-17 10:42:48,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:42:48,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:42:48,960 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:42:48,960 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] [2022-10-17 10:42:48,961 INFO L748 eck$LassoCheckResult]: Stem: 347#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(16, 2);call #Ultimate.allocInit(12, 3); 328#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_~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_~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;havoc main_~cond~0#1; 329#L155-1 [2022-10-17 10:42:48,961 INFO L750 eck$LassoCheckResult]: Loop: 329#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 373#L43 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; 371#L68 assume !(0 != main_~p1~0#1); 369#L68-2 assume !(0 != main_~p2~0#1); 368#L72-1 assume !(0 != main_~p3~0#1); 367#L76-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 366#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 365#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 364#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 363#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 362#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 361#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 359#L104-1 assume !(0 != main_~p1~0#1); 360#L110-1 assume !(0 != main_~p2~0#1); 391#L115-1 assume !(0 != main_~p3~0#1); 388#L120-1 assume !(0 != main_~p4~0#1); 385#L125-1 assume !(0 != main_~p5~0#1); 383#L130-1 assume !(0 != main_~p6~0#1); 381#L135-1 assume !(0 != main_~p7~0#1); 379#L140-1 assume !(0 != main_~p8~0#1); 377#L145-1 assume !(0 != main_~p9~0#1); 375#L150-1 assume !(0 != main_~p10~0#1); 329#L155-1 [2022-10-17 10:42:48,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:48,962 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-10-17 10:42:48,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:48,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412902195] [2022-10-17 10:42:48,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:48,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:48,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:42:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:48,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:42:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:48,986 INFO L85 PathProgramCache]: Analyzing trace with hash 95215385, now seen corresponding path program 1 times [2022-10-17 10:42:48,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:48,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491200485] [2022-10-17 10:42:48,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:48,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:42:49,095 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:42:49,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:42:49,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491200485] [2022-10-17 10:42:49,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491200485] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:42:49,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:42:49,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:42:49,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664609404] [2022-10-17 10:42:49,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:42:49,097 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:42:49,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:42:49,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:42:49,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:42:49,099 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. cyclomatic complexity: 76 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:42:49,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:42:49,139 INFO L93 Difference]: Finished difference Result 246 states and 382 transitions. [2022-10-17 10:42:49,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 382 transitions. [2022-10-17 10:42:49,143 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2022-10-17 10:42:49,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 246 states and 382 transitions. [2022-10-17 10:42:49,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 246 [2022-10-17 10:42:49,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246 [2022-10-17 10:42:49,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 382 transitions. [2022-10-17 10:42:49,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:42:49,150 INFO L218 hiAutomatonCegarLoop]: Abstraction has 246 states and 382 transitions. [2022-10-17 10:42:49,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 382 transitions. [2022-10-17 10:42:49,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-10-17 10:42:49,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 246 states have (on average 1.5528455284552845) internal successors, (382), 245 states have internal predecessors, (382), 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:42:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 382 transitions. [2022-10-17 10:42:49,174 INFO L240 hiAutomatonCegarLoop]: Abstraction has 246 states and 382 transitions. [2022-10-17 10:42:49,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:42:49,175 INFO L428 stractBuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2022-10-17 10:42:49,175 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-10-17 10:42:49,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 382 transitions. [2022-10-17 10:42:49,178 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2022-10-17 10:42:49,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:42:49,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:42:49,179 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:42:49,179 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] [2022-10-17 10:42:49,179 INFO L748 eck$LassoCheckResult]: Stem: 729#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(16, 2);call #Ultimate.allocInit(12, 3); 706#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_~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_~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;havoc main_~cond~0#1; 707#L155-1 [2022-10-17 10:42:49,180 INFO L750 eck$LassoCheckResult]: Loop: 707#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 776#L43 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; 773#L68 assume !(0 != main_~p1~0#1); 769#L68-2 assume !(0 != main_~p2~0#1); 767#L72-1 assume !(0 != main_~p3~0#1); 764#L76-1 assume !(0 != main_~p4~0#1); 765#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 759#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 760#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 755#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 756#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 751#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 752#L104-1 assume !(0 != main_~p1~0#1); 807#L110-1 assume !(0 != main_~p2~0#1); 805#L115-1 assume !(0 != main_~p3~0#1); 802#L120-1 assume !(0 != main_~p4~0#1); 799#L125-1 assume !(0 != main_~p5~0#1); 795#L130-1 assume !(0 != main_~p6~0#1); 791#L135-1 assume !(0 != main_~p7~0#1); 787#L140-1 assume !(0 != main_~p8~0#1); 783#L145-1 assume !(0 != main_~p9~0#1); 781#L150-1 assume !(0 != main_~p10~0#1); 707#L155-1 [2022-10-17 10:42:49,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-10-17 10:42:49,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:49,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772725599] [2022-10-17 10:42:49,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:49,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:49,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:42:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:49,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:42:49,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:49,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1493132517, now seen corresponding path program 1 times [2022-10-17 10:42:49,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:49,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077623113] [2022-10-17 10:42:49,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:49,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:42:49,248 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:42:49,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:42:49,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077623113] [2022-10-17 10:42:49,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077623113] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:42:49,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:42:49,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:42:49,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696757434] [2022-10-17 10:42:49,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:42:49,250 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:42:49,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:42:49,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:42:49,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:42:49,251 INFO L87 Difference]: Start difference. First operand 246 states and 382 transitions. cyclomatic complexity: 144 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:42:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:42:49,292 INFO L93 Difference]: Finished difference Result 482 states and 738 transitions. [2022-10-17 10:42:49,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 738 transitions. [2022-10-17 10:42:49,301 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2022-10-17 10:42:49,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 482 states and 738 transitions. [2022-10-17 10:42:49,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2022-10-17 10:42:49,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2022-10-17 10:42:49,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 482 states and 738 transitions. [2022-10-17 10:42:49,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:42:49,313 INFO L218 hiAutomatonCegarLoop]: Abstraction has 482 states and 738 transitions. [2022-10-17 10:42:49,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states and 738 transitions. [2022-10-17 10:42:49,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2022-10-17 10:42:49,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 482 states have (on average 1.5311203319502074) internal successors, (738), 481 states have internal predecessors, (738), 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:42:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 738 transitions. [2022-10-17 10:42:49,368 INFO L240 hiAutomatonCegarLoop]: Abstraction has 482 states and 738 transitions. [2022-10-17 10:42:49,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:42:49,369 INFO L428 stractBuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2022-10-17 10:42:49,369 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-10-17 10:42:49,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 738 transitions. [2022-10-17 10:42:49,373 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2022-10-17 10:42:49,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:42:49,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:42:49,374 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:42:49,374 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] [2022-10-17 10:42:49,375 INFO L748 eck$LassoCheckResult]: Stem: 1462#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(16, 2);call #Ultimate.allocInit(12, 3); 1440#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_~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_~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;havoc main_~cond~0#1; 1441#L155-1 [2022-10-17 10:42:49,375 INFO L750 eck$LassoCheckResult]: Loop: 1441#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 1511#L43 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; 1508#L68 assume !(0 != main_~p1~0#1); 1504#L68-2 assume !(0 != main_~p2~0#1); 1501#L72-1 assume !(0 != main_~p3~0#1); 1498#L76-1 assume !(0 != main_~p4~0#1); 1499#L80-1 assume !(0 != main_~p5~0#1); 1562#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1559#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1556#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1553#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1551#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1548#L104-1 assume !(0 != main_~p1~0#1); 1544#L110-1 assume !(0 != main_~p2~0#1); 1541#L115-1 assume !(0 != main_~p3~0#1); 1537#L120-1 assume !(0 != main_~p4~0#1); 1534#L125-1 assume !(0 != main_~p5~0#1); 1532#L130-1 assume !(0 != main_~p6~0#1); 1528#L135-1 assume !(0 != main_~p7~0#1); 1524#L140-1 assume !(0 != main_~p8~0#1); 1520#L145-1 assume !(0 != main_~p9~0#1); 1516#L150-1 assume !(0 != main_~p10~0#1); 1441#L155-1 [2022-10-17 10:42:49,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:49,376 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-10-17 10:42:49,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:49,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646650945] [2022-10-17 10:42:49,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:49,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:49,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:42:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:49,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:42:49,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:49,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1780766425, now seen corresponding path program 1 times [2022-10-17 10:42:49,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:49,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655122669] [2022-10-17 10:42:49,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:49,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:42:49,481 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:42:49,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:42:49,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655122669] [2022-10-17 10:42:49,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655122669] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:42:49,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:42:49,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:42:49,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259788330] [2022-10-17 10:42:49,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:42:49,483 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:42:49,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:42:49,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:42:49,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:42:49,484 INFO L87 Difference]: Start difference. First operand 482 states and 738 transitions. cyclomatic complexity: 272 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:42:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:42:49,525 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2022-10-17 10:42:49,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 946 states and 1426 transitions. [2022-10-17 10:42:49,536 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2022-10-17 10:42:49,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 946 states to 946 states and 1426 transitions. [2022-10-17 10:42:49,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 946 [2022-10-17 10:42:49,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 946 [2022-10-17 10:42:49,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 946 states and 1426 transitions. [2022-10-17 10:42:49,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:42:49,553 INFO L218 hiAutomatonCegarLoop]: Abstraction has 946 states and 1426 transitions. [2022-10-17 10:42:49,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states and 1426 transitions. [2022-10-17 10:42:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2022-10-17 10:42:49,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 946 states have (on average 1.507399577167019) internal successors, (1426), 945 states have internal predecessors, (1426), 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:42:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1426 transitions. [2022-10-17 10:42:49,592 INFO L240 hiAutomatonCegarLoop]: Abstraction has 946 states and 1426 transitions. [2022-10-17 10:42:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:42:49,593 INFO L428 stractBuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2022-10-17 10:42:49,593 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-10-17 10:42:49,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 946 states and 1426 transitions. [2022-10-17 10:42:49,600 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2022-10-17 10:42:49,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:42:49,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:42:49,601 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:42:49,602 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] [2022-10-17 10:42:49,602 INFO L748 eck$LassoCheckResult]: Stem: 2899#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(16, 2);call #Ultimate.allocInit(12, 3); 2874#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_~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_~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;havoc main_~cond~0#1; 2875#L155-1 [2022-10-17 10:42:49,602 INFO L750 eck$LassoCheckResult]: Loop: 2875#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 2948#L43 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; 2949#L68 assume !(0 != main_~p1~0#1); 3042#L68-2 assume !(0 != main_~p2~0#1); 3037#L72-1 assume !(0 != main_~p3~0#1); 3031#L76-1 assume !(0 != main_~p4~0#1); 3032#L80-1 assume !(0 != main_~p5~0#1); 3051#L84-1 assume !(0 != main_~p6~0#1); 3047#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3045#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3039#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3035#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3028#L104-1 assume !(0 != main_~p1~0#1); 3001#L110-1 assume !(0 != main_~p2~0#1); 2998#L115-1 assume !(0 != main_~p3~0#1); 2993#L120-1 assume !(0 != main_~p4~0#1); 2989#L125-1 assume !(0 != main_~p5~0#1); 2987#L130-1 assume !(0 != main_~p6~0#1); 2972#L135-1 assume !(0 != main_~p7~0#1); 2971#L140-1 assume !(0 != main_~p8~0#1); 3067#L145-1 assume !(0 != main_~p9~0#1); 2956#L150-1 assume !(0 != main_~p10~0#1); 2875#L155-1 [2022-10-17 10:42:49,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:49,603 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-10-17 10:42:49,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:49,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170973476] [2022-10-17 10:42:49,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:49,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:49,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:42:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:49,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:42:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:49,623 INFO L85 PathProgramCache]: Analyzing trace with hash 500902747, now seen corresponding path program 1 times [2022-10-17 10:42:49,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:49,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651889151] [2022-10-17 10:42:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:49,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:42:49,654 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:42:49,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:42:49,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651889151] [2022-10-17 10:42:49,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651889151] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:42:49,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:42:49,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:42:49,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890366111] [2022-10-17 10:42:49,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:42:49,656 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:42:49,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:42:49,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:42:49,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:42:49,657 INFO L87 Difference]: Start difference. First operand 946 states and 1426 transitions. cyclomatic complexity: 512 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:42:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:42:49,681 INFO L93 Difference]: Finished difference Result 1858 states and 2754 transitions. [2022-10-17 10:42:49,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1858 states and 2754 transitions. [2022-10-17 10:42:49,704 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2022-10-17 10:42:49,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1858 states to 1858 states and 2754 transitions. [2022-10-17 10:42:49,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1858 [2022-10-17 10:42:49,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1858 [2022-10-17 10:42:49,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1858 states and 2754 transitions. [2022-10-17 10:42:49,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:42:49,727 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2022-10-17 10:42:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states and 2754 transitions. [2022-10-17 10:42:49,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2022-10-17 10:42:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1858 states have (on average 1.4822389666307858) internal successors, (2754), 1857 states have internal predecessors, (2754), 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:42:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2754 transitions. [2022-10-17 10:42:49,782 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2022-10-17 10:42:49,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:42:49,785 INFO L428 stractBuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2022-10-17 10:42:49,787 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-10-17 10:42:49,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1858 states and 2754 transitions. [2022-10-17 10:42:49,802 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2022-10-17 10:42:49,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:42:49,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:42:49,804 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:42:49,804 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] [2022-10-17 10:42:49,804 INFO L748 eck$LassoCheckResult]: Stem: 5706#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(16, 2);call #Ultimate.allocInit(12, 3); 5684#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_~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_~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;havoc main_~cond~0#1; 5685#L155-1 [2022-10-17 10:42:49,805 INFO L750 eck$LassoCheckResult]: Loop: 5685#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 5885#L43 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; 5882#L68 assume !(0 != main_~p1~0#1); 5878#L68-2 assume !(0 != main_~p2~0#1); 5875#L72-1 assume !(0 != main_~p3~0#1); 5873#L76-1 assume !(0 != main_~p4~0#1); 5863#L80-1 assume !(0 != main_~p5~0#1); 5865#L84-1 assume !(0 != main_~p6~0#1); 5850#L88-1 assume !(0 != main_~p7~0#1); 5852#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 5838#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 5839#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 5825#L104-1 assume !(0 != main_~p1~0#1); 5826#L110-1 assume !(0 != main_~p2~0#1); 5804#L115-1 assume !(0 != main_~p3~0#1); 5803#L120-1 assume !(0 != main_~p4~0#1); 5903#L125-1 assume !(0 != main_~p5~0#1); 5901#L130-1 assume !(0 != main_~p6~0#1); 5899#L135-1 assume !(0 != main_~p7~0#1); 5896#L140-1 assume !(0 != main_~p8~0#1); 5894#L145-1 assume !(0 != main_~p9~0#1); 5890#L150-1 assume !(0 != main_~p10~0#1); 5685#L155-1 [2022-10-17 10:42:49,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:49,814 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-10-17 10:42:49,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:49,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558437413] [2022-10-17 10:42:49,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:49,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:49,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:42:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:49,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:42:49,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:49,847 INFO L85 PathProgramCache]: Analyzing trace with hash -510214503, now seen corresponding path program 1 times [2022-10-17 10:42:49,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:49,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433547476] [2022-10-17 10:42:49,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:49,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:42:49,901 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:42:49,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:42:49,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433547476] [2022-10-17 10:42:49,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433547476] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:42:49,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:42:49,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:42:49,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482270170] [2022-10-17 10:42:49,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:42:49,904 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:42:49,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:42:49,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:42:49,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:42:49,932 INFO L87 Difference]: Start difference. First operand 1858 states and 2754 transitions. cyclomatic complexity: 960 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:42:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:42:49,975 INFO L93 Difference]: Finished difference Result 3650 states and 5314 transitions. [2022-10-17 10:42:49,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3650 states and 5314 transitions. [2022-10-17 10:42:50,014 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2022-10-17 10:42:50,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3650 states to 3650 states and 5314 transitions. [2022-10-17 10:42:50,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3650 [2022-10-17 10:42:50,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3650 [2022-10-17 10:42:50,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3650 states and 5314 transitions. [2022-10-17 10:42:50,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:42:50,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2022-10-17 10:42:50,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states and 5314 transitions. [2022-10-17 10:42:50,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3650. [2022-10-17 10:42:50,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 3650 states have (on average 1.4558904109589041) internal successors, (5314), 3649 states have internal predecessors, (5314), 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:42:50,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 5314 transitions. [2022-10-17 10:42:50,159 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2022-10-17 10:42:50,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:42:50,163 INFO L428 stractBuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2022-10-17 10:42:50,163 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-10-17 10:42:50,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3650 states and 5314 transitions. [2022-10-17 10:42:50,186 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2022-10-17 10:42:50,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:42:50,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:42:50,189 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:42:50,190 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] [2022-10-17 10:42:50,191 INFO L748 eck$LassoCheckResult]: Stem: 11221#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(16, 2);call #Ultimate.allocInit(12, 3); 11198#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_~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_~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;havoc main_~cond~0#1; 11199#L155-1 [2022-10-17 10:42:50,191 INFO L750 eck$LassoCheckResult]: Loop: 11199#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 11355#L43 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; 11352#L68 assume !(0 != main_~p1~0#1); 11348#L68-2 assume !(0 != main_~p2~0#1); 11345#L72-1 assume !(0 != main_~p3~0#1); 11342#L76-1 assume !(0 != main_~p4~0#1); 11291#L80-1 assume !(0 != main_~p5~0#1); 11277#L84-1 assume !(0 != main_~p6~0#1); 11279#L88-1 assume !(0 != main_~p7~0#1); 11480#L92-1 assume !(0 != main_~p8~0#1); 11481#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 11482#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 11439#L104-1 assume !(0 != main_~p1~0#1); 11436#L110-1 assume !(0 != main_~p2~0#1); 11423#L115-1 assume !(0 != main_~p3~0#1); 11416#L120-1 assume !(0 != main_~p4~0#1); 11411#L125-1 assume !(0 != main_~p5~0#1); 11404#L130-1 assume !(0 != main_~p6~0#1); 11398#L135-1 assume !(0 != main_~p7~0#1); 11393#L140-1 assume !(0 != main_~p8~0#1); 11387#L145-1 assume !(0 != main_~p9~0#1); 11360#L150-1 assume !(0 != main_~p10~0#1); 11199#L155-1 [2022-10-17 10:42:50,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:50,192 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-10-17 10:42:50,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:50,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641192777] [2022-10-17 10:42:50,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:50,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:50,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:42:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:50,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:42:50,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:50,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1097020517, now seen corresponding path program 1 times [2022-10-17 10:42:50,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:50,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842515244] [2022-10-17 10:42:50,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:50,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:42:50,250 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:42:50,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:42:50,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842515244] [2022-10-17 10:42:50,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842515244] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:42:50,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:42:50,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:42:50,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322916274] [2022-10-17 10:42:50,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:42:50,252 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:42:50,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:42:50,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:42:50,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:42:50,253 INFO L87 Difference]: Start difference. First operand 3650 states and 5314 transitions. cyclomatic complexity: 1792 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:42:50,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:42:50,322 INFO L93 Difference]: Finished difference Result 7170 states and 10242 transitions. [2022-10-17 10:42:50,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7170 states and 10242 transitions. [2022-10-17 10:42:50,389 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2022-10-17 10:42:50,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7170 states to 7170 states and 10242 transitions. [2022-10-17 10:42:50,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7170 [2022-10-17 10:42:50,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7170 [2022-10-17 10:42:50,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7170 states and 10242 transitions. [2022-10-17 10:42:50,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:42:50,469 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2022-10-17 10:42:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states and 10242 transitions. [2022-10-17 10:42:50,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 7170. [2022-10-17 10:42:50,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7170 states, 7170 states have (on average 1.4284518828451882) internal successors, (10242), 7169 states have internal predecessors, (10242), 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:42:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 10242 transitions. [2022-10-17 10:42:50,704 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2022-10-17 10:42:50,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:42:50,708 INFO L428 stractBuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2022-10-17 10:42:50,709 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-10-17 10:42:50,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7170 states and 10242 transitions. [2022-10-17 10:42:50,746 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2022-10-17 10:42:50,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:42:50,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:42:50,747 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:42:50,748 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] [2022-10-17 10:42:50,748 INFO L748 eck$LassoCheckResult]: Stem: 22047#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(16, 2);call #Ultimate.allocInit(12, 3); 22025#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_~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_~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;havoc main_~cond~0#1; 22026#L155-1 [2022-10-17 10:42:50,748 INFO L750 eck$LassoCheckResult]: Loop: 22026#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 22222#L43 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; 22212#L68 assume !(0 != main_~p1~0#1); 22214#L68-2 assume !(0 != main_~p2~0#1); 22204#L72-1 assume !(0 != main_~p3~0#1); 22205#L76-1 assume !(0 != main_~p4~0#1); 22437#L80-1 assume !(0 != main_~p5~0#1); 22435#L84-1 assume !(0 != main_~p6~0#1); 22431#L88-1 assume !(0 != main_~p7~0#1); 22427#L92-1 assume !(0 != main_~p8~0#1); 22423#L96-1 assume !(0 != main_~p9~0#1); 22421#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 22417#L104-1 assume !(0 != main_~p1~0#1); 22413#L110-1 assume !(0 != main_~p2~0#1); 22409#L115-1 assume !(0 != main_~p3~0#1); 22406#L120-1 assume !(0 != main_~p4~0#1); 22401#L125-1 assume !(0 != main_~p5~0#1); 22402#L130-1 assume !(0 != main_~p6~0#1); 22391#L135-1 assume !(0 != main_~p7~0#1); 22392#L140-1 assume !(0 != main_~p8~0#1); 22228#L145-1 assume !(0 != main_~p9~0#1); 22229#L150-1 assume !(0 != main_~p10~0#1); 22026#L155-1 [2022-10-17 10:42:50,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:50,749 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-10-17 10:42:50,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:50,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809586307] [2022-10-17 10:42:50,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:50,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:50,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:42:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:50,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:42:50,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:50,776 INFO L85 PathProgramCache]: Analyzing trace with hash -838855079, now seen corresponding path program 1 times [2022-10-17 10:42:50,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:50,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119093030] [2022-10-17 10:42:50,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:50,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:42:50,817 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:42:50,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:42:50,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119093030] [2022-10-17 10:42:50,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119093030] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:42:50,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:42:50,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:42:50,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923519074] [2022-10-17 10:42:50,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:42:50,819 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:42:50,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:42:50,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:42:50,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:42:50,820 INFO L87 Difference]: Start difference. First operand 7170 states and 10242 transitions. cyclomatic complexity: 3328 Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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:42:50,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:42:50,998 INFO L93 Difference]: Finished difference Result 14082 states and 19714 transitions. [2022-10-17 10:42:50,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14082 states and 19714 transitions. [2022-10-17 10:42:51,092 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2022-10-17 10:42:51,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14082 states to 14082 states and 19714 transitions. [2022-10-17 10:42:51,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14082 [2022-10-17 10:42:51,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14082 [2022-10-17 10:42:51,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14082 states and 19714 transitions. [2022-10-17 10:42:51,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:42:51,276 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2022-10-17 10:42:51,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14082 states and 19714 transitions. [2022-10-17 10:42:51,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14082 to 14082. [2022-10-17 10:42:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14082 states, 14082 states have (on average 1.3999431898878) internal successors, (19714), 14081 states have internal predecessors, (19714), 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:42:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14082 states to 14082 states and 19714 transitions. [2022-10-17 10:42:51,821 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2022-10-17 10:42:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:42:51,823 INFO L428 stractBuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2022-10-17 10:42:51,823 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-10-17 10:42:51,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14082 states and 19714 transitions. [2022-10-17 10:42:51,902 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2022-10-17 10:42:51,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:42:51,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:42:51,904 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:42:51,905 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] [2022-10-17 10:42:51,905 INFO L748 eck$LassoCheckResult]: Stem: 43305#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(16, 2);call #Ultimate.allocInit(12, 3); 43283#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_~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_~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;havoc main_~cond~0#1; 43284#L155-1 [2022-10-17 10:42:51,906 INFO L750 eck$LassoCheckResult]: Loop: 43284#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 43670#L43 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; 43660#L68 assume !(0 != main_~p1~0#1); 43662#L68-2 assume !(0 != main_~p2~0#1); 43651#L72-1 assume !(0 != main_~p3~0#1); 43652#L76-1 assume !(0 != main_~p4~0#1); 43620#L80-1 assume !(0 != main_~p5~0#1); 43622#L84-1 assume !(0 != main_~p6~0#1); 43715#L88-1 assume !(0 != main_~p7~0#1); 43717#L92-1 assume !(0 != main_~p8~0#1); 43779#L96-1 assume !(0 != main_~p9~0#1); 43776#L100-1 assume !(0 != main_~p10~0#1); 43772#L104-1 assume !(0 != main_~p1~0#1); 43768#L110-1 assume !(0 != main_~p2~0#1); 43765#L115-1 assume !(0 != main_~p3~0#1); 43761#L120-1 assume !(0 != main_~p4~0#1); 43444#L125-1 assume !(0 != main_~p5~0#1); 43445#L130-1 assume !(0 != main_~p6~0#1); 43434#L135-1 assume !(0 != main_~p7~0#1); 43436#L140-1 assume !(0 != main_~p8~0#1); 43679#L145-1 assume !(0 != main_~p9~0#1); 43681#L150-1 assume !(0 != main_~p10~0#1); 43284#L155-1 [2022-10-17 10:42:51,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-10-17 10:42:51,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:51,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799967152] [2022-10-17 10:42:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:51,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:42:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:51,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:42:51,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:51,935 INFO L85 PathProgramCache]: Analyzing trace with hash -137790501, now seen corresponding path program 1 times [2022-10-17 10:42:51,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:51,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461096393] [2022-10-17 10:42:51,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:51,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:51,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:42:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:51,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:42:51,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:42:51,965 INFO L85 PathProgramCache]: Analyzing trace with hash -970235363, now seen corresponding path program 1 times [2022-10-17 10:42:51,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:42:51,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115054959] [2022-10-17 10:42:51,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:42:51,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:42:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:51,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:42:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:52,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:42:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:52,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:42:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:42:52,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.10 10:42:52 BoogieIcfgContainer [2022-10-17 10:42:52,741 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-10-17 10:42:52,742 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 10:42:52,742 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 10:42:52,742 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 10:42:52,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:42:48" (3/4) ... [2022-10-17 10:42:52,745 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-10-17 10:42:52,809 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5a20fd2-845f-415d-a35e-9c5bd637ded6/bin/uautomizer-J5u9QxTXDZ/witness.graphml [2022-10-17 10:42:52,809 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 10:42:52,810 INFO L158 Benchmark]: Toolchain (without parser) took 5466.99ms. Allocated memory was 100.7MB in the beginning and 318.8MB in the end (delta: 218.1MB). Free memory was 65.1MB in the beginning and 208.0MB in the end (delta: -143.0MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. [2022-10-17 10:42:52,810 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 100.7MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 10:42:52,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.13ms. Allocated memory is still 100.7MB. Free memory was 64.9MB in the beginning and 75.8MB in the end (delta: -10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-10-17 10:42:52,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.65ms. Allocated memory is still 100.7MB. Free memory was 75.8MB in the beginning and 74.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 10:42:52,812 INFO L158 Benchmark]: Boogie Preprocessor took 25.13ms. Allocated memory is still 100.7MB. Free memory was 74.1MB in the beginning and 72.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:42:52,812 INFO L158 Benchmark]: RCFGBuilder took 394.77ms. Allocated memory is still 100.7MB. Free memory was 72.5MB in the beginning and 60.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-10-17 10:42:52,812 INFO L158 Benchmark]: BuchiAutomizer took 4642.35ms. Allocated memory was 100.7MB in the beginning and 318.8MB in the end (delta: 218.1MB). Free memory was 60.1MB in the beginning and 211.2MB in the end (delta: -151.1MB). Peak memory consumption was 68.5MB. Max. memory is 16.1GB. [2022-10-17 10:42:52,813 INFO L158 Benchmark]: Witness Printer took 67.45ms. Allocated memory is still 318.8MB. Free memory was 211.2MB in the beginning and 208.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-10-17 10:42:52,815 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.31ms. Allocated memory is still 100.7MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.13ms. Allocated memory is still 100.7MB. Free memory was 64.9MB in the beginning and 75.8MB in the end (delta: -10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.65ms. Allocated memory is still 100.7MB. Free memory was 75.8MB in the beginning and 74.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.13ms. Allocated memory is still 100.7MB. Free memory was 74.1MB in the beginning and 72.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 394.77ms. Allocated memory is still 100.7MB. Free memory was 72.5MB in the beginning and 60.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 4642.35ms. Allocated memory was 100.7MB in the beginning and 318.8MB in the end (delta: 218.1MB). Free memory was 60.1MB in the beginning and 211.2MB in the end (delta: -151.1MB). Peak memory consumption was 68.5MB. Max. memory is 16.1GB. * Witness Printer took 67.45ms. Allocated memory is still 318.8MB. Free memory was 211.2MB in the beginning and 208.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. 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 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 14082 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.1s. Büchi inclusion checks took 2.3s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 1.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. 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, 374 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 374 mSDsluCounter, 1167 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 445 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 722 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 41]: 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; [L39] int cond; Loop: [L41] COND TRUE 1 [L42] cond = __VERIFIER_nondet_int() [L43] COND FALSE !(cond == 0) [L46] lk1 = 0 [L48] lk2 = 0 [L50] lk3 = 0 [L52] lk4 = 0 [L54] lk5 = 0 [L56] lk6 = 0 [L58] lk7 = 0 [L60] lk8 = 0 [L62] lk9 = 0 [L64] lk10 = 0 [L68] COND FALSE !(p1 != 0) [L72] COND FALSE !(p2 != 0) [L76] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L84] COND FALSE !(p5 != 0) [L88] COND FALSE !(p6 != 0) [L92] COND FALSE !(p7 != 0) [L96] COND FALSE !(p8 != 0) [L100] COND FALSE !(p9 != 0) [L104] COND FALSE !(p10 != 0) [L110] COND FALSE !(p1 != 0) [L115] COND FALSE !(p2 != 0) [L120] COND FALSE !(p3 != 0) [L125] COND FALSE !(p4 != 0) [L130] COND FALSE !(p5 != 0) [L135] COND FALSE !(p6 != 0) [L140] COND FALSE !(p7 != 0) [L145] COND FALSE !(p8 != 0) [L150] COND FALSE !(p9 != 0) [L155] COND FALSE !(p10 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 41]: 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; [L39] int cond; Loop: [L41] COND TRUE 1 [L42] cond = __VERIFIER_nondet_int() [L43] COND FALSE !(cond == 0) [L46] lk1 = 0 [L48] lk2 = 0 [L50] lk3 = 0 [L52] lk4 = 0 [L54] lk5 = 0 [L56] lk6 = 0 [L58] lk7 = 0 [L60] lk8 = 0 [L62] lk9 = 0 [L64] lk10 = 0 [L68] COND FALSE !(p1 != 0) [L72] COND FALSE !(p2 != 0) [L76] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L84] COND FALSE !(p5 != 0) [L88] COND FALSE !(p6 != 0) [L92] COND FALSE !(p7 != 0) [L96] COND FALSE !(p8 != 0) [L100] COND FALSE !(p9 != 0) [L104] COND FALSE !(p10 != 0) [L110] COND FALSE !(p1 != 0) [L115] COND FALSE !(p2 != 0) [L120] COND FALSE !(p3 != 0) [L125] COND FALSE !(p4 != 0) [L130] COND FALSE !(p5 != 0) [L135] COND FALSE !(p6 != 0) [L140] COND FALSE !(p7 != 0) [L145] COND FALSE !(p8 != 0) [L150] COND FALSE !(p9 != 0) [L155] COND FALSE !(p10 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-10-17 10:42:52,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5a20fd2-845f-415d-a35e-9c5bd637ded6/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)