./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52478f87-a33f-4954-81ac-d2cc8e47d2dd/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52478f87-a33f-4954-81ac-d2cc8e47d2dd/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52478f87-a33f-4954-81ac-d2cc8e47d2dd/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52478f87-a33f-4954-81ac-d2cc8e47d2dd/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_8.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52478f87-a33f-4954-81ac-d2cc8e47d2dd/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52478f87-a33f-4954-81ac-d2cc8e47d2dd/bin/uautomizer-uyxdKDjOR8 --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 b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 --- 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-2329fc7 [2022-12-13 13:27:24,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:27:24,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:27:24,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:27:24,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:27:24,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:27:24,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:27:24,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:27:24,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:27:24,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:27:24,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:27:24,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:27:24,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:27:24,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:27:24,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:27:24,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:27:24,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:27:24,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:27:24,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:27:24,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:27:24,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:27:24,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:27:24,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:27:24,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:27:24,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:27:24,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:27:24,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:27:24,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:27:24,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:27:24,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:27:24,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:27:24,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:27:24,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:27:24,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:27:24,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:27:24,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:27:24,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:27:24,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:27:24,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:27:24,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:27:24,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:27:24,507 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52478f87-a33f-4954-81ac-d2cc8e47d2dd/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-12-13 13:27:24,528 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:27:24,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:27:24,528 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:27:24,528 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:27:24,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:27:24,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:27:24,529 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:27:24,535 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 13:27:24,535 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 13:27:24,535 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 13:27:24,535 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 13:27:24,535 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 13:27:24,535 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 13:27:24,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:27:24,536 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:27:24,536 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:27:24,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:27:24,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:27:24,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:27:24,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 13:27:24,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 13:27:24,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 13:27:24,537 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:27:24,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:27:24,537 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 13:27:24,537 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:27:24,537 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 13:27:24,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:27:24,537 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:27:24,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:27:24,538 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:27:24,538 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 13:27:24,539 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_52478f87-a33f-4954-81ac-d2cc8e47d2dd/bin/uautomizer-uyxdKDjOR8/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_52478f87-a33f-4954-81ac-d2cc8e47d2dd/bin/uautomizer-uyxdKDjOR8 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 -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2022-12-13 13:27:24,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:27:24,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:27:24,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:27:24,731 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:27:24,731 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:27:24,732 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52478f87-a33f-4954-81ac-d2cc8e47d2dd/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/locks/test_locks_8.c [2022-12-13 13:27:27,289 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:27:27,432 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:27:27,432 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52478f87-a33f-4954-81ac-d2cc8e47d2dd/sv-benchmarks/c/locks/test_locks_8.c [2022-12-13 13:27:27,437 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52478f87-a33f-4954-81ac-d2cc8e47d2dd/bin/uautomizer-uyxdKDjOR8/data/22875a0e2/83664f4fd6c94a32b14acc2b30331854/FLAG19043365a [2022-12-13 13:27:27,447 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52478f87-a33f-4954-81ac-d2cc8e47d2dd/bin/uautomizer-uyxdKDjOR8/data/22875a0e2/83664f4fd6c94a32b14acc2b30331854 [2022-12-13 13:27:27,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:27:27,450 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:27:27,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:27:27,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:27:27,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:27:27,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:27:27" (1/1) ... [2022-12-13 13:27:27,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26dffe29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:27, skipping insertion in model container [2022-12-13 13:27:27,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:27:27" (1/1) ... [2022-12-13 13:27:27,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:27:27,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:27:27,581 WARN L237 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_52478f87-a33f-4954-81ac-d2cc8e47d2dd/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2022-12-13 13:27:27,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:27:27,590 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:27:27,604 WARN L237 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_52478f87-a33f-4954-81ac-d2cc8e47d2dd/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2022-12-13 13:27:27,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:27:27,614 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:27:27,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:27 WrapperNode [2022-12-13 13:27:27,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:27:27,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:27:27,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:27:27,616 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:27:27,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:27" (1/1) ... [2022-12-13 13:27:27,626 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:27" (1/1) ... [2022-12-13 13:27:27,638 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 107 [2022-12-13 13:27:27,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:27:27,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:27:27,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:27:27,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:27:27,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:27" (1/1) ... [2022-12-13 13:27:27,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:27" (1/1) ... [2022-12-13 13:27:27,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:27" (1/1) ... [2022-12-13 13:27:27,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:27" (1/1) ... [2022-12-13 13:27:27,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:27" (1/1) ... [2022-12-13 13:27:27,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:27" (1/1) ... [2022-12-13 13:27:27,653 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:27" (1/1) ... [2022-12-13 13:27:27,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:27" (1/1) ... [2022-12-13 13:27:27,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:27:27,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:27:27,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:27:27,656 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:27:27,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:27" (1/1) ... [2022-12-13 13:27:27,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:27:27,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52478f87-a33f-4954-81ac-d2cc8e47d2dd/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:27:27,681 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52478f87-a33f-4954-81ac-d2cc8e47d2dd/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:27:27,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52478f87-a33f-4954-81ac-d2cc8e47d2dd/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 13:27:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:27:27,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:27:27,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:27:27,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:27:27,782 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:27:27,784 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:27:27,911 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:27:27,915 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:27:27,915 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 13:27:27,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:27:27 BoogieIcfgContainer [2022-12-13 13:27:27,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:27:27,918 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 13:27:27,918 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 13:27:27,921 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 13:27:27,921 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 13:27:27,921 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 01:27:27" (1/3) ... [2022-12-13 13:27:27,922 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78375b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 01:27:27, skipping insertion in model container [2022-12-13 13:27:27,922 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 13:27:27,922 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:27" (2/3) ... [2022-12-13 13:27:27,923 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78375b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 01:27:27, skipping insertion in model container [2022-12-13 13:27:27,929 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 13:27:27,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:27:27" (3/3) ... [2022-12-13 13:27:27,931 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_8.c [2022-12-13 13:27:27,980 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 13:27:27,980 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 13:27:27,980 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 13:27:27,980 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 13:27:27,980 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 13:27:27,980 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 13:27:27,981 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 13:27:27,981 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 13:27:27,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:27:28,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2022-12-13 13:27:28,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:27:28,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:27:28,009 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:27:28,009 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:28,009 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 13:27:28,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:27:28,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2022-12-13 13:27:28,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:27:28,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:27:28,016 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:27:28,016 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:28,023 INFO L748 eck$LassoCheckResult]: Stem: 31#$Ultimate##0true 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(15, 2);call #Ultimate.allocInit(12, 3); 7#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_~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_~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;havoc main_~cond~0#1; 19#L127-1true [2022-12-13 13:27:28,024 INFO L750 eck$LassoCheckResult]: Loop: 19#L127-1true assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 26#L37true 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; 6#L58true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 13#L58-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 15#L62-1true assume !(0 != main_~p3~0#1); 27#L66-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 29#L70-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 32#L74-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 24#L78-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 10#L82-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8#L86-1true assume !(0 != main_~p1~0#1); 5#L92-1true assume !(0 != main_~p2~0#1); 16#L97-1true assume !(0 != main_~p3~0#1); 21#L102-1true assume !(0 != main_~p4~0#1); 18#L107-1true assume !(0 != main_~p5~0#1); 33#L112-1true assume !(0 != main_~p6~0#1); 30#L117-1true assume !(0 != main_~p7~0#1); 11#L122-1true assume !(0 != main_~p8~0#1); 19#L127-1true [2022-12-13 13:27:28,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:28,029 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-12-13 13:27:28,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:28,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391072661] [2022-12-13 13:27:28,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:28,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:28,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:27:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:28,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:27:28,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:28,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1098697512, now seen corresponding path program 1 times [2022-12-13 13:27:28,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:28,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970362964] [2022-12-13 13:27:28,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:28,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:28,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:28,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970362964] [2022-12-13 13:27:28,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970362964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:28,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:27:28,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:27:28,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093892068] [2022-12-13 13:27:28,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:28,220 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 13:27:28,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:28,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:27:28,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:27:28,249 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:27:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:28,281 INFO L93 Difference]: Finished difference Result 63 states and 106 transitions. [2022-12-13 13:27:28,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 106 transitions. [2022-12-13 13:27:28,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2022-12-13 13:27:28,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 53 states and 83 transitions. [2022-12-13 13:27:28,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2022-12-13 13:27:28,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2022-12-13 13:27:28,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 83 transitions. [2022-12-13 13:27:28,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:27:28,294 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 83 transitions. [2022-12-13 13:27:28,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 83 transitions. [2022-12-13 13:27:28,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-12-13 13:27:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 52 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:27:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2022-12-13 13:27:28,317 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 83 transitions. [2022-12-13 13:27:28,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:27:28,321 INFO L428 stractBuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2022-12-13 13:27:28,321 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 13:27:28,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2022-12-13 13:27:28,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2022-12-13 13:27:28,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:27:28,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:27:28,322 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:27:28,323 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:28,323 INFO L748 eck$LassoCheckResult]: Stem: 137#$Ultimate##0 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(15, 2);call #Ultimate.allocInit(12, 3); 112#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_~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_~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;havoc main_~cond~0#1; 113#L127-1 [2022-12-13 13:27:28,323 INFO L750 eck$LassoCheckResult]: Loop: 113#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 140#L37 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; 138#L58 assume !(0 != main_~p1~0#1); 139#L58-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 157#L62-1 assume !(0 != main_~p3~0#1); 156#L66-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 155#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 154#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 153#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 152#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 151#L86-1 assume !(0 != main_~p1~0#1); 109#L92-1 assume !(0 != main_~p2~0#1); 108#L97-1 assume !(0 != main_~p3~0#1); 123#L102-1 assume !(0 != main_~p4~0#1); 128#L107-1 assume !(0 != main_~p5~0#1); 143#L112-1 assume !(0 != main_~p6~0#1); 136#L117-1 assume !(0 != main_~p7~0#1); 130#L122-1 assume !(0 != main_~p8~0#1); 113#L127-1 [2022-12-13 13:27:28,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:28,324 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-12-13 13:27:28,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:28,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189097740] [2022-12-13 13:27:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:28,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:28,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:27:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:28,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:27:28,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:28,337 INFO L85 PathProgramCache]: Analyzing trace with hash 77629158, now seen corresponding path program 1 times [2022-12-13 13:27:28,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:28,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101705334] [2022-12-13 13:27:28,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:28,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:28,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:28,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101705334] [2022-12-13 13:27:28,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101705334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:28,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:27:28,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:27:28,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057260494] [2022-12-13 13:27:28,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:28,371 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 13:27:28,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:28,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:27:28,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:27:28,372 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:27:28,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:28,391 INFO L93 Difference]: Finished difference Result 102 states and 158 transitions. [2022-12-13 13:27:28,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 158 transitions. [2022-12-13 13:27:28,395 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2022-12-13 13:27:28,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 158 transitions. [2022-12-13 13:27:28,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2022-12-13 13:27:28,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2022-12-13 13:27:28,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 158 transitions. [2022-12-13 13:27:28,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:27:28,400 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 158 transitions. [2022-12-13 13:27:28,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 158 transitions. [2022-12-13 13:27:28,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-12-13 13:27:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.5490196078431373) internal successors, (158), 101 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:27:28,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2022-12-13 13:27:28,412 INFO L240 hiAutomatonCegarLoop]: Abstraction has 102 states and 158 transitions. [2022-12-13 13:27:28,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:27:28,414 INFO L428 stractBuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2022-12-13 13:27:28,414 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 13:27:28,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 158 transitions. [2022-12-13 13:27:28,416 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2022-12-13 13:27:28,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:27:28,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:27:28,417 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:27:28,417 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:28,418 INFO L748 eck$LassoCheckResult]: Stem: 300#$Ultimate##0 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(15, 2);call #Ultimate.allocInit(12, 3); 273#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_~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_~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;havoc main_~cond~0#1; 274#L127-1 [2022-12-13 13:27:28,418 INFO L750 eck$LassoCheckResult]: Loop: 274#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 322#L37 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; 320#L58 assume !(0 != main_~p1~0#1); 317#L58-2 assume !(0 != main_~p2~0#1); 315#L62-1 assume !(0 != main_~p3~0#1); 313#L66-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 311#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 309#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 307#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 305#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 304#L86-1 assume !(0 != main_~p1~0#1); 301#L92-1 assume !(0 != main_~p2~0#1); 302#L97-1 assume !(0 != main_~p3~0#1); 344#L102-1 assume !(0 != main_~p4~0#1); 338#L107-1 assume !(0 != main_~p5~0#1); 333#L112-1 assume !(0 != main_~p6~0#1); 330#L117-1 assume !(0 != main_~p7~0#1); 326#L122-1 assume !(0 != main_~p8~0#1); 274#L127-1 [2022-12-13 13:27:28,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:28,419 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-12-13 13:27:28,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:28,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377040290] [2022-12-13 13:27:28,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:28,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:28,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:27:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:28,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:27:28,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:28,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1202234520, now seen corresponding path program 1 times [2022-12-13 13:27:28,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:28,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561828218] [2022-12-13 13:27:28,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:28,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:28,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:28,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561828218] [2022-12-13 13:27:28,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561828218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:28,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:27:28,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:27:28,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618616605] [2022-12-13 13:27:28,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:28,478 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 13:27:28,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:28,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:27:28,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:27:28,479 INFO L87 Difference]: Start difference. First operand 102 states and 158 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:27:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:28,497 INFO L93 Difference]: Finished difference Result 198 states and 302 transitions. [2022-12-13 13:27:28,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 302 transitions. [2022-12-13 13:27:28,501 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2022-12-13 13:27:28,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 302 transitions. [2022-12-13 13:27:28,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2022-12-13 13:27:28,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2022-12-13 13:27:28,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 302 transitions. [2022-12-13 13:27:28,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:27:28,505 INFO L218 hiAutomatonCegarLoop]: Abstraction has 198 states and 302 transitions. [2022-12-13 13:27:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 302 transitions. [2022-12-13 13:27:28,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-12-13 13:27:28,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 198 states have (on average 1.5252525252525253) internal successors, (302), 197 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:27:28,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 302 transitions. [2022-12-13 13:27:28,518 INFO L240 hiAutomatonCegarLoop]: Abstraction has 198 states and 302 transitions. [2022-12-13 13:27:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:27:28,519 INFO L428 stractBuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2022-12-13 13:27:28,519 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 13:27:28,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 302 transitions. [2022-12-13 13:27:28,522 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2022-12-13 13:27:28,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:27:28,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:27:28,522 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:27:28,522 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:28,523 INFO L748 eck$LassoCheckResult]: Stem: 606#$Ultimate##0 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(15, 2);call #Ultimate.allocInit(12, 3); 579#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_~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_~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;havoc main_~cond~0#1; 580#L127-1 [2022-12-13 13:27:28,523 INFO L750 eck$LassoCheckResult]: Loop: 580#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 668#L37 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; 666#L58 assume !(0 != main_~p1~0#1); 667#L58-2 assume !(0 != main_~p2~0#1); 719#L62-1 assume !(0 != main_~p3~0#1); 707#L66-1 assume !(0 != main_~p4~0#1); 708#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 717#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 706#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 703#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 693#L86-1 assume !(0 != main_~p1~0#1); 688#L92-1 assume !(0 != main_~p2~0#1); 686#L97-1 assume !(0 != main_~p3~0#1); 681#L102-1 assume !(0 != main_~p4~0#1); 678#L107-1 assume !(0 != main_~p5~0#1); 674#L112-1 assume !(0 != main_~p6~0#1); 672#L117-1 assume !(0 != main_~p7~0#1); 670#L122-1 assume !(0 != main_~p8~0#1); 580#L127-1 [2022-12-13 13:27:28,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:28,524 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-12-13 13:27:28,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:28,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099291282] [2022-12-13 13:27:28,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:28,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:28,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:27:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:28,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:27:28,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:28,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1789040534, now seen corresponding path program 1 times [2022-12-13 13:27:28,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:28,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106255175] [2022-12-13 13:27:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:28,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:28,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:28,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106255175] [2022-12-13 13:27:28,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106255175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:28,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:27:28,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:27:28,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79512993] [2022-12-13 13:27:28,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:28,575 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 13:27:28,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:28,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:27:28,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:27:28,576 INFO L87 Difference]: Start difference. First operand 198 states and 302 transitions. cyclomatic complexity: 112 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:27:28,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:28,593 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2022-12-13 13:27:28,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 578 transitions. [2022-12-13 13:27:28,597 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2022-12-13 13:27:28,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 386 states and 578 transitions. [2022-12-13 13:27:28,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2022-12-13 13:27:28,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2022-12-13 13:27:28,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 578 transitions. [2022-12-13 13:27:28,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:27:28,603 INFO L218 hiAutomatonCegarLoop]: Abstraction has 386 states and 578 transitions. [2022-12-13 13:27:28,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 578 transitions. [2022-12-13 13:27:28,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2022-12-13 13:27:28,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 386 states have (on average 1.4974093264248705) internal successors, (578), 385 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:27:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 578 transitions. [2022-12-13 13:27:28,625 INFO L240 hiAutomatonCegarLoop]: Abstraction has 386 states and 578 transitions. [2022-12-13 13:27:28,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:27:28,626 INFO L428 stractBuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2022-12-13 13:27:28,626 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 13:27:28,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 578 transitions. [2022-12-13 13:27:28,629 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2022-12-13 13:27:28,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:27:28,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:27:28,630 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:27:28,630 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:28,630 INFO L748 eck$LassoCheckResult]: Stem: 1203#$Ultimate##0 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(15, 2);call #Ultimate.allocInit(12, 3); 1170#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_~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_~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;havoc main_~cond~0#1; 1171#L127-1 [2022-12-13 13:27:28,631 INFO L750 eck$LassoCheckResult]: Loop: 1171#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 1283#L37 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; 1268#L58 assume !(0 != main_~p1~0#1); 1270#L58-2 assume !(0 != main_~p2~0#1); 1247#L62-1 assume !(0 != main_~p3~0#1); 1248#L66-1 assume !(0 != main_~p4~0#1); 1358#L70-1 assume !(0 != main_~p5~0#1); 1350#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1351#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1342#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1343#L86-1 assume !(0 != main_~p1~0#1); 1376#L92-1 assume !(0 != main_~p2~0#1); 1374#L97-1 assume !(0 != main_~p3~0#1); 1372#L102-1 assume !(0 != main_~p4~0#1); 1370#L107-1 assume !(0 != main_~p5~0#1); 1368#L112-1 assume !(0 != main_~p6~0#1); 1366#L117-1 assume !(0 != main_~p7~0#1); 1363#L122-1 assume !(0 != main_~p8~0#1); 1171#L127-1 [2022-12-13 13:27:28,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:28,631 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-12-13 13:27:28,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:28,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611341902] [2022-12-13 13:27:28,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:28,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:28,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:27:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:28,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:27:28,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:28,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1530875096, now seen corresponding path program 1 times [2022-12-13 13:27:28,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:28,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326104926] [2022-12-13 13:27:28,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:28,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:28,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326104926] [2022-12-13 13:27:28,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326104926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:28,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:27:28,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:27:28,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861030385] [2022-12-13 13:27:28,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:28,675 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 13:27:28,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:28,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:27:28,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:27:28,676 INFO L87 Difference]: Start difference. First operand 386 states and 578 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:27:28,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:28,690 INFO L93 Difference]: Finished difference Result 754 states and 1106 transitions. [2022-12-13 13:27:28,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1106 transitions. [2022-12-13 13:27:28,697 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2022-12-13 13:27:28,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 754 states and 1106 transitions. [2022-12-13 13:27:28,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 754 [2022-12-13 13:27:28,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 754 [2022-12-13 13:27:28,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 754 states and 1106 transitions. [2022-12-13 13:27:28,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:27:28,704 INFO L218 hiAutomatonCegarLoop]: Abstraction has 754 states and 1106 transitions. [2022-12-13 13:27:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states and 1106 transitions. [2022-12-13 13:27:28,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2022-12-13 13:27:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 754 states have (on average 1.46684350132626) internal successors, (1106), 753 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:27:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1106 transitions. [2022-12-13 13:27:28,735 INFO L240 hiAutomatonCegarLoop]: Abstraction has 754 states and 1106 transitions. [2022-12-13 13:27:28,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:27:28,736 INFO L428 stractBuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2022-12-13 13:27:28,736 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-12-13 13:27:28,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 754 states and 1106 transitions. [2022-12-13 13:27:28,738 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2022-12-13 13:27:28,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:27:28,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:27:28,739 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:27:28,739 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:28,739 INFO L748 eck$LassoCheckResult]: Stem: 2347#$Ultimate##0 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(15, 2);call #Ultimate.allocInit(12, 3); 2315#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_~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_~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;havoc main_~cond~0#1; 2316#L127-1 [2022-12-13 13:27:28,739 INFO L750 eck$LassoCheckResult]: Loop: 2316#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 2415#L37 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; 2411#L58 assume !(0 != main_~p1~0#1); 2409#L58-2 assume !(0 != main_~p2~0#1); 2407#L62-1 assume !(0 != main_~p3~0#1); 2403#L66-1 assume !(0 != main_~p4~0#1); 2399#L70-1 assume !(0 != main_~p5~0#1); 2395#L74-1 assume !(0 != main_~p6~0#1); 2393#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2391#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2387#L86-1 assume !(0 != main_~p1~0#1); 2385#L92-1 assume !(0 != main_~p2~0#1); 2377#L97-1 assume !(0 != main_~p3~0#1); 2378#L102-1 assume !(0 != main_~p4~0#1); 2430#L107-1 assume !(0 != main_~p5~0#1); 2426#L112-1 assume !(0 != main_~p6~0#1); 2423#L117-1 assume !(0 != main_~p7~0#1); 2419#L122-1 assume !(0 != main_~p8~0#1); 2316#L127-1 [2022-12-13 13:27:28,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:28,740 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-12-13 13:27:28,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:28,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769675143] [2022-12-13 13:27:28,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:28,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:28,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:27:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:28,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:27:28,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:28,747 INFO L85 PathProgramCache]: Analyzing trace with hash -829810518, now seen corresponding path program 1 times [2022-12-13 13:27:28,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:28,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132009891] [2022-12-13 13:27:28,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:28,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:28,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:28,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132009891] [2022-12-13 13:27:28,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132009891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:28,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:27:28,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:27:28,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528307388] [2022-12-13 13:27:28,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:28,766 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 13:27:28,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:28,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:27:28,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:27:28,767 INFO L87 Difference]: Start difference. First operand 754 states and 1106 transitions. cyclomatic complexity: 384 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:27:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:28,784 INFO L93 Difference]: Finished difference Result 1474 states and 2114 transitions. [2022-12-13 13:27:28,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 2114 transitions. [2022-12-13 13:27:28,797 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2022-12-13 13:27:28,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 1474 states and 2114 transitions. [2022-12-13 13:27:28,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1474 [2022-12-13 13:27:28,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1474 [2022-12-13 13:27:28,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1474 states and 2114 transitions. [2022-12-13 13:27:28,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:27:28,809 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2022-12-13 13:27:28,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states and 2114 transitions. [2022-12-13 13:27:28,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2022-12-13 13:27:28,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1474 states have (on average 1.4341926729986432) internal successors, (2114), 1473 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:27:28,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2114 transitions. [2022-12-13 13:27:28,841 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2022-12-13 13:27:28,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:27:28,842 INFO L428 stractBuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2022-12-13 13:27:28,843 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-12-13 13:27:28,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1474 states and 2114 transitions. [2022-12-13 13:27:28,850 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2022-12-13 13:27:28,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:27:28,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:27:28,851 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:27:28,851 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:28,851 INFO L748 eck$LassoCheckResult]: Stem: 4587#$Ultimate##0 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(15, 2);call #Ultimate.allocInit(12, 3); 4550#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_~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_~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;havoc main_~cond~0#1; 4551#L127-1 [2022-12-13 13:27:28,851 INFO L750 eck$LassoCheckResult]: Loop: 4551#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 4725#L37 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; 4722#L58 assume !(0 != main_~p1~0#1); 4718#L58-2 assume !(0 != main_~p2~0#1); 4715#L62-1 assume !(0 != main_~p3~0#1); 4713#L66-1 assume !(0 != main_~p4~0#1); 4703#L70-1 assume !(0 != main_~p5~0#1); 4704#L74-1 assume !(0 != main_~p6~0#1); 4700#L78-1 assume !(0 != main_~p7~0#1); 4702#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4691#L86-1 assume !(0 != main_~p1~0#1); 4693#L92-1 assume !(0 != main_~p2~0#1); 4637#L97-1 assume !(0 != main_~p3~0#1); 4638#L102-1 assume !(0 != main_~p4~0#1); 4737#L107-1 assume !(0 != main_~p5~0#1); 4735#L112-1 assume !(0 != main_~p6~0#1); 4733#L117-1 assume !(0 != main_~p7~0#1); 4730#L122-1 assume !(0 != main_~p8~0#1); 4551#L127-1 [2022-12-13 13:27:28,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:28,852 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-12-13 13:27:28,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:28,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646831462] [2022-12-13 13:27:28,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:28,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:28,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:27:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:28,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:27:28,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:28,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1222837528, now seen corresponding path program 1 times [2022-12-13 13:27:28,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:28,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146950806] [2022-12-13 13:27:28,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:28,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:28,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:28,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:28,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146950806] [2022-12-13 13:27:28,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146950806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:28,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:27:28,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:27:28,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67116645] [2022-12-13 13:27:28,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:28,885 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 13:27:28,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:28,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:27:28,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:27:28,886 INFO L87 Difference]: Start difference. First operand 1474 states and 2114 transitions. cyclomatic complexity: 704 Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:27:28,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:28,903 INFO L93 Difference]: Finished difference Result 2882 states and 4034 transitions. [2022-12-13 13:27:28,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2882 states and 4034 transitions. [2022-12-13 13:27:28,916 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2022-12-13 13:27:28,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2882 states to 2882 states and 4034 transitions. [2022-12-13 13:27:28,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2882 [2022-12-13 13:27:28,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2882 [2022-12-13 13:27:28,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2882 states and 4034 transitions. [2022-12-13 13:27:28,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:27:28,929 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2022-12-13 13:27:28,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states and 4034 transitions. [2022-12-13 13:27:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2022-12-13 13:27:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2882 states, 2882 states have (on average 1.3997224149895906) internal successors, (4034), 2881 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:27:28,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4034 transitions. [2022-12-13 13:27:28,963 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2022-12-13 13:27:28,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:27:28,964 INFO L428 stractBuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2022-12-13 13:27:28,964 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-12-13 13:27:28,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2882 states and 4034 transitions. [2022-12-13 13:27:28,972 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2022-12-13 13:27:28,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:27:28,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:27:28,972 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:27:28,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:28,973 INFO L748 eck$LassoCheckResult]: Stem: 8939#$Ultimate##0 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(15, 2);call #Ultimate.allocInit(12, 3); 8912#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_~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_~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;havoc main_~cond~0#1; 8913#L127-1 [2022-12-13 13:27:28,973 INFO L750 eck$LassoCheckResult]: Loop: 8913#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 9072#L37 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; 9069#L58 assume !(0 != main_~p1~0#1); 9066#L58-2 assume !(0 != main_~p2~0#1); 9060#L62-1 assume !(0 != main_~p3~0#1); 9061#L66-1 assume !(0 != main_~p4~0#1); 9123#L70-1 assume !(0 != main_~p5~0#1); 9117#L74-1 assume !(0 != main_~p6~0#1); 9111#L78-1 assume !(0 != main_~p7~0#1); 9104#L82-1 assume !(0 != main_~p8~0#1); 9097#L86-1 assume !(0 != main_~p1~0#1); 9096#L92-1 assume !(0 != main_~p2~0#1); 9093#L97-1 assume !(0 != main_~p3~0#1); 9090#L102-1 assume !(0 != main_~p4~0#1); 9088#L107-1 assume !(0 != main_~p5~0#1); 9084#L112-1 assume !(0 != main_~p6~0#1); 9080#L117-1 assume !(0 != main_~p7~0#1); 9076#L122-1 assume !(0 != main_~p8~0#1); 8913#L127-1 [2022-12-13 13:27:28,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-12-13 13:27:28,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:28,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770208585] [2022-12-13 13:27:28,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:28,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:28,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:27:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:28,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:27:28,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:28,982 INFO L85 PathProgramCache]: Analyzing trace with hash -542779158, now seen corresponding path program 1 times [2022-12-13 13:27:28,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:28,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072094663] [2022-12-13 13:27:28,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:28,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:28,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:27:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:28,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:27:28,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:28,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1175900116, now seen corresponding path program 1 times [2022-12-13 13:27:28,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:28,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519377539] [2022-12-13 13:27:28,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:28,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:29,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:27:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:29,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:27:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:29,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:27:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:29,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.12 01:27:29 BoogieIcfgContainer [2022-12-13 13:27:29,294 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-12-13 13:27:29,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:27:29,295 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:27:29,295 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:27:29,295 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:27:27" (3/4) ... [2022-12-13 13:27:29,298 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-12-13 13:27:29,333 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52478f87-a33f-4954-81ac-d2cc8e47d2dd/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 13:27:29,333 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:27:29,334 INFO L158 Benchmark]: Toolchain (without parser) took 1883.87ms. Allocated memory was 102.8MB in the beginning and 159.4MB in the end (delta: 56.6MB). Free memory was 60.1MB in the beginning and 108.9MB in the end (delta: -48.8MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2022-12-13 13:27:29,334 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 102.8MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:27:29,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.52ms. Allocated memory is still 102.8MB. Free memory was 59.8MB in the beginning and 49.2MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 13:27:29,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.23ms. Allocated memory is still 102.8MB. Free memory was 49.2MB in the beginning and 47.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:27:29,335 INFO L158 Benchmark]: Boogie Preprocessor took 15.78ms. Allocated memory is still 102.8MB. Free memory was 47.6MB in the beginning and 46.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:27:29,335 INFO L158 Benchmark]: RCFGBuilder took 261.65ms. Allocated memory is still 102.8MB. Free memory was 46.1MB in the beginning and 34.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 13:27:29,336 INFO L158 Benchmark]: BuchiAutomizer took 1376.35ms. Allocated memory was 102.8MB in the beginning and 159.4MB in the end (delta: 56.6MB). Free memory was 34.7MB in the beginning and 110.9MB in the end (delta: -76.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:27:29,336 INFO L158 Benchmark]: Witness Printer took 38.63ms. Allocated memory is still 159.4MB. Free memory was 110.9MB in the beginning and 108.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:27:29,338 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.13ms. Allocated memory is still 102.8MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 164.52ms. Allocated memory is still 102.8MB. Free memory was 59.8MB in the beginning and 49.2MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.23ms. Allocated memory is still 102.8MB. Free memory was 49.2MB in the beginning and 47.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.78ms. Allocated memory is still 102.8MB. Free memory was 47.6MB in the beginning and 46.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 261.65ms. Allocated memory is still 102.8MB. Free memory was 46.1MB in the beginning and 34.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1376.35ms. Allocated memory was 102.8MB in the beginning and 159.4MB in the end (delta: 56.6MB). Free memory was 34.7MB in the beginning and 110.9MB in the end (delta: -76.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 38.63ms. Allocated memory is still 159.4MB. Free memory was 110.9MB in the beginning and 108.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2882 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s 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, 236 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 736 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 277 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 459 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI7 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 35]: 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; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 35]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-12-13 13:27:29,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52478f87-a33f-4954-81ac-d2cc8e47d2dd/bin/uautomizer-uyxdKDjOR8/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)