./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_14-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b4ec56b 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_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/bin/uautomizer-ug76WZFUDN/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_14-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/bin/uautomizer-ug76WZFUDN --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 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- 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-6b4ec56 [2022-11-20 09:30:00,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:30:00,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:30:00,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:30:00,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:30:00,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:30:00,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:30:00,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:30:00,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:30:00,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:30:00,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:30:00,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:30:00,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:30:00,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:30:00,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:30:00,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:30:00,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:30:00,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:30:00,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:30:00,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:30:00,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:30:00,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:30:00,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:30:00,735 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:30:00,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:30:00,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:30:00,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:30:00,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:30:00,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:30:00,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:30:00,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:30:00,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:30:00,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:30:00,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:30:00,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:30:00,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:30:00,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:30:00,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:30:00,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:30:00,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:30:00,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:30:00,768 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-20 09:30:00,820 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:30:00,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:30:00,821 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:30:00,822 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:30:00,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:30:00,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:30:00,824 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:30:00,824 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-20 09:30:00,825 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-20 09:30:00,825 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-20 09:30:00,826 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-20 09:30:00,827 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-20 09:30:00,827 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-20 09:30:00,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:30:00,828 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:30:00,828 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:30:00,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:30:00,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:30:00,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:30:00,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-20 09:30:00,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-20 09:30:00,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-20 09:30:00,830 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:30:00,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:30:00,831 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-20 09:30:00,831 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:30:00,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-20 09:30:00,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:30:00,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:30:00,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:30:00,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:30:00,836 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-20 09:30:00,836 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_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/bin/uautomizer-ug76WZFUDN/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_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/bin/uautomizer-ug76WZFUDN 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 -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2022-11-20 09:30:01,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:30:01,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:30:01,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:30:01,255 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:30:01,256 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:30:01,258 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/locks/test_locks_14-2.c [2022-11-20 09:30:04,818 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:30:05,085 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:30:05,086 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/sv-benchmarks/c/locks/test_locks_14-2.c [2022-11-20 09:30:05,096 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/bin/uautomizer-ug76WZFUDN/data/bb4e71623/7fc973826589476895b138143c05309d/FLAG54d1a5ae2 [2022-11-20 09:30:05,115 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/bin/uautomizer-ug76WZFUDN/data/bb4e71623/7fc973826589476895b138143c05309d [2022-11-20 09:30:05,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:30:05,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:30:05,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:30:05,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:30:05,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:30:05,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:30:05" (1/1) ... [2022-11-20 09:30:05,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d9c20a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:05, skipping insertion in model container [2022-11-20 09:30:05,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:30:05" (1/1) ... [2022-11-20 09:30:05,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:30:05,166 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:30:05,373 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_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/sv-benchmarks/c/locks/test_locks_14-2.c[5305,5318] [2022-11-20 09:30:05,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:30:05,391 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:30:05,439 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_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/sv-benchmarks/c/locks/test_locks_14-2.c[5305,5318] [2022-11-20 09:30:05,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:30:05,456 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:30:05,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:05 WrapperNode [2022-11-20 09:30:05,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:30:05,458 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:30:05,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:30:05,459 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:30:05,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:05" (1/1) ... [2022-11-20 09:30:05,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:05" (1/1) ... [2022-11-20 09:30:05,497 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 169 [2022-11-20 09:30:05,498 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:30:05,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:30:05,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:30:05,499 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:30:05,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:05" (1/1) ... [2022-11-20 09:30:05,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:05" (1/1) ... [2022-11-20 09:30:05,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:05" (1/1) ... [2022-11-20 09:30:05,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:05" (1/1) ... [2022-11-20 09:30:05,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:05" (1/1) ... [2022-11-20 09:30:05,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:05" (1/1) ... [2022-11-20 09:30:05,523 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:05" (1/1) ... [2022-11-20 09:30:05,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:05" (1/1) ... [2022-11-20 09:30:05,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:30:05,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:30:05,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:30:05,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:30:05,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:05" (1/1) ... [2022-11-20 09:30:05,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:30:05,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:30:05,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:30:05,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-20 09:30:05,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:30:05,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:30:05,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:30:05,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:30:05,791 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:30:05,794 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:30:06,261 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:30:06,270 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:30:06,270 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 09:30:06,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:30:06 BoogieIcfgContainer [2022-11-20 09:30:06,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:30:06,275 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-20 09:30:06,275 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-20 09:30:06,280 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-20 09:30:06,281 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 09:30:06,282 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 09:30:05" (1/3) ... [2022-11-20 09:30:06,283 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@770912bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 09:30:06, skipping insertion in model container [2022-11-20 09:30:06,283 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 09:30:06,284 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:05" (2/3) ... [2022-11-20 09:30:06,284 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@770912bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 09:30:06, skipping insertion in model container [2022-11-20 09:30:06,284 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 09:30:06,285 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:30:06" (3/3) ... [2022-11-20 09:30:06,286 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_14-2.c [2022-11-20 09:30:06,399 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-20 09:30:06,400 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-20 09:30:06,400 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-20 09:30:06,400 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-20 09:30:06,401 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-20 09:30:06,401 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-20 09:30:06,401 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-20 09:30:06,401 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-20 09:30:06,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:06,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2022-11-20 09:30:06,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:30:06,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:30:06,451 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 09:30:06,452 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:06,452 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-20 09:30:06,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:06,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2022-11-20 09:30:06,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:30:06,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:30:06,466 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 09:30:06,466 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:06,479 INFO L748 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 34#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 31#L211true [2022-11-20 09:30:06,482 INFO L750 eck$LassoCheckResult]: Loop: 31#L211true assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 45#L55true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 22#L88true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 11#L88-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 32#L92-1true assume !(0 != main_~p3~0#1); 3#L96-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 6#L100-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 48#L104-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 12#L108-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 51#L112-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 26#L116-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 38#L120-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 33#L124-1true assume !(0 != main_~p11~0#1); 16#L128-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 46#L132-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 41#L136-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 37#L140-1true assume !(0 != main_~p1~0#1); 17#L146-1true assume 0 != main_~p2~0#1; 27#L152true assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 13#L151true assume !(0 != main_~p3~0#1); 28#L156-1true assume !(0 != main_~p4~0#1); 4#L161-1true assume !(0 != main_~p5~0#1); 10#L166-1true assume !(0 != main_~p6~0#1); 24#L171-1true assume !(0 != main_~p7~0#1); 20#L176-1true assume !(0 != main_~p8~0#1); 49#L181-1true assume !(0 != main_~p9~0#1); 21#L186-1true assume !(0 != main_~p10~0#1); 36#L191-1true assume !(0 != main_~p11~0#1); 50#L196-1true assume !(0 != main_~p12~0#1); 25#L201-1true assume !(0 != main_~p13~0#1); 14#L206-1true assume 0 != main_~p14~0#1; 8#L212true assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 31#L211true [2022-11-20 09:30:06,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:06,497 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-20 09:30:06,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:06,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657437212] [2022-11-20 09:30:06,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:06,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:06,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:30:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:06,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:30:06,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:06,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1237702727, now seen corresponding path program 1 times [2022-11-20 09:30:06,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:06,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83976548] [2022-11-20 09:30:06,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:06,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:06,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:06,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83976548] [2022-11-20 09:30:06,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83976548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:06,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:06,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:30:06,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101299882] [2022-11-20 09:30:06,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:06,968 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:30:06,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:07,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:07,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:07,017 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11-20 09:30:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:07,076 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2022-11-20 09:30:07,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 178 transitions. [2022-11-20 09:30:07,082 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2022-11-20 09:30:07,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 89 states and 139 transitions. [2022-11-20 09:30:07,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2022-11-20 09:30:07,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2022-11-20 09:30:07,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 139 transitions. [2022-11-20 09:30:07,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:30:07,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 139 transitions. [2022-11-20 09:30:07,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 139 transitions. [2022-11-20 09:30:07,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-20 09:30:07,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.5617977528089888) internal successors, (139), 88 states have internal predecessors, (139), 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-11-20 09:30:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2022-11-20 09:30:07,132 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 139 transitions. [2022-11-20 09:30:07,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:07,139 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 139 transitions. [2022-11-20 09:30:07,139 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-20 09:30:07,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 139 transitions. [2022-11-20 09:30:07,141 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2022-11-20 09:30:07,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:30:07,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:30:07,142 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 09:30:07,142 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:07,143 INFO L748 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 175#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 176#L211 [2022-11-20 09:30:07,143 INFO L750 eck$LassoCheckResult]: Loop: 176#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 222#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 221#L88 assume !(0 != main_~p1~0#1); 220#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 219#L92-1 assume !(0 != main_~p3~0#1); 218#L96-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 217#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 207#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 186#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 187#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 205#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 184#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 173#L124-1 assume !(0 != main_~p11~0#1); 174#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 194#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 212#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 210#L140-1 assume !(0 != main_~p1~0#1); 211#L146-1 assume 0 != main_~p2~0#1; 247#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 246#L151 assume !(0 != main_~p3~0#1); 244#L156-1 assume !(0 != main_~p4~0#1); 242#L161-1 assume !(0 != main_~p5~0#1); 240#L166-1 assume !(0 != main_~p6~0#1); 237#L171-1 assume !(0 != main_~p7~0#1); 236#L176-1 assume !(0 != main_~p8~0#1); 234#L181-1 assume !(0 != main_~p9~0#1); 231#L186-1 assume !(0 != main_~p10~0#1); 230#L191-1 assume !(0 != main_~p11~0#1); 228#L196-1 assume !(0 != main_~p12~0#1); 226#L201-1 assume !(0 != main_~p13~0#1); 224#L206-1 assume 0 != main_~p14~0#1; 223#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 176#L211 [2022-11-20 09:30:07,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:07,144 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-11-20 09:30:07,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:07,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864640850] [2022-11-20 09:30:07,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:07,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:07,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:30:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:07,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:30:07,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:07,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1215070473, now seen corresponding path program 1 times [2022-11-20 09:30:07,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:07,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773720165] [2022-11-20 09:30:07,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:07,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:07,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:07,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773720165] [2022-11-20 09:30:07,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773720165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:07,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:07,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:30:07,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441606956] [2022-11-20 09:30:07,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:07,277 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:30:07,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:07,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:07,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:07,279 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11-20 09:30:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:07,313 INFO L93 Difference]: Finished difference Result 174 states and 270 transitions. [2022-11-20 09:30:07,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 270 transitions. [2022-11-20 09:30:07,317 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2022-11-20 09:30:07,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 270 transitions. [2022-11-20 09:30:07,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2022-11-20 09:30:07,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2022-11-20 09:30:07,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 270 transitions. [2022-11-20 09:30:07,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:30:07,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 174 states and 270 transitions. [2022-11-20 09:30:07,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 270 transitions. [2022-11-20 09:30:07,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-11-20 09:30:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5517241379310345) internal successors, (270), 173 states have internal predecessors, (270), 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-11-20 09:30:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 270 transitions. [2022-11-20 09:30:07,340 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 270 transitions. [2022-11-20 09:30:07,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:07,342 INFO L428 stractBuchiCegarLoop]: Abstraction has 174 states and 270 transitions. [2022-11-20 09:30:07,342 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-20 09:30:07,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 270 transitions. [2022-11-20 09:30:07,346 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2022-11-20 09:30:07,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:30:07,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:30:07,347 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 09:30:07,347 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:07,347 INFO L748 eck$LassoCheckResult]: Stem: 462#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 444#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 445#L211 [2022-11-20 09:30:07,348 INFO L750 eck$LassoCheckResult]: Loop: 445#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 504#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 502#L88 assume !(0 != main_~p1~0#1); 499#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 496#L92-1 assume !(0 != main_~p3~0#1); 492#L96-1 assume !(0 != main_~p4~0#1); 489#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 488#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 487#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 486#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 475#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 453#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 442#L124-1 assume !(0 != main_~p11~0#1); 443#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 463#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 482#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 479#L140-1 assume !(0 != main_~p1~0#1); 481#L146-1 assume 0 != main_~p2~0#1; 574#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 571#L151 assume !(0 != main_~p3~0#1); 568#L156-1 assume !(0 != main_~p4~0#1); 566#L161-1 assume !(0 != main_~p5~0#1); 562#L166-1 assume !(0 != main_~p6~0#1); 555#L171-1 assume !(0 != main_~p7~0#1); 552#L176-1 assume !(0 != main_~p8~0#1); 535#L181-1 assume !(0 != main_~p9~0#1); 532#L186-1 assume !(0 != main_~p10~0#1); 531#L191-1 assume !(0 != main_~p11~0#1); 529#L196-1 assume !(0 != main_~p12~0#1); 527#L201-1 assume !(0 != main_~p13~0#1); 519#L206-1 assume 0 != main_~p14~0#1; 518#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 445#L211 [2022-11-20 09:30:07,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:07,349 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-11-20 09:30:07,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:07,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242405828] [2022-11-20 09:30:07,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:07,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:07,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:30:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:07,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:30:07,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:07,367 INFO L85 PathProgramCache]: Analyzing trace with hash 708157561, now seen corresponding path program 1 times [2022-11-20 09:30:07,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:07,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468029467] [2022-11-20 09:30:07,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:07,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:07,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:07,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468029467] [2022-11-20 09:30:07,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468029467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:07,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:07,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:30:07,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88040422] [2022-11-20 09:30:07,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:07,441 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:30:07,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:07,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:07,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:07,443 INFO L87 Difference]: Start difference. First operand 174 states and 270 transitions. cyclomatic complexity: 100 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11-20 09:30:07,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:07,491 INFO L93 Difference]: Finished difference Result 342 states and 526 transitions. [2022-11-20 09:30:07,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 526 transitions. [2022-11-20 09:30:07,496 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2022-11-20 09:30:07,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 526 transitions. [2022-11-20 09:30:07,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2022-11-20 09:30:07,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2022-11-20 09:30:07,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 526 transitions. [2022-11-20 09:30:07,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:30:07,514 INFO L218 hiAutomatonCegarLoop]: Abstraction has 342 states and 526 transitions. [2022-11-20 09:30:07,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 526 transitions. [2022-11-20 09:30:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-11-20 09:30:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 342 states have (on average 1.5380116959064327) internal successors, (526), 341 states have internal predecessors, (526), 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-11-20 09:30:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 526 transitions. [2022-11-20 09:30:07,558 INFO L240 hiAutomatonCegarLoop]: Abstraction has 342 states and 526 transitions. [2022-11-20 09:30:07,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:07,560 INFO L428 stractBuchiCegarLoop]: Abstraction has 342 states and 526 transitions. [2022-11-20 09:30:07,560 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-20 09:30:07,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 526 transitions. [2022-11-20 09:30:07,581 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2022-11-20 09:30:07,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:30:07,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:30:07,587 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 09:30:07,587 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:07,587 INFO L748 eck$LassoCheckResult]: Stem: 984#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 966#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 967#L211 [2022-11-20 09:30:07,587 INFO L750 eck$LassoCheckResult]: Loop: 967#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1039#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 1035#L88 assume !(0 != main_~p1~0#1); 1029#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 1025#L92-1 assume !(0 != main_~p3~0#1); 1026#L96-1 assume !(0 != main_~p4~0#1); 1164#L100-1 assume !(0 != main_~p5~0#1); 1162#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1160#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1158#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1156#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1154#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1152#L124-1 assume !(0 != main_~p11~0#1); 1150#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1148#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1146#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1143#L140-1 assume !(0 != main_~p1~0#1); 1140#L146-1 assume 0 != main_~p2~0#1; 1138#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 1131#L151 assume !(0 != main_~p3~0#1); 1126#L156-1 assume !(0 != main_~p4~0#1); 1123#L161-1 assume !(0 != main_~p5~0#1); 1120#L166-1 assume !(0 != main_~p6~0#1); 1115#L171-1 assume !(0 != main_~p7~0#1); 1112#L176-1 assume !(0 != main_~p8~0#1); 1109#L181-1 assume !(0 != main_~p9~0#1); 1105#L186-1 assume !(0 != main_~p10~0#1); 1102#L191-1 assume !(0 != main_~p11~0#1); 1084#L196-1 assume !(0 != main_~p12~0#1); 1060#L201-1 assume !(0 != main_~p13~0#1); 1050#L206-1 assume 0 != main_~p14~0#1; 1046#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 967#L211 [2022-11-20 09:30:07,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:07,588 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-11-20 09:30:07,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:07,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679464680] [2022-11-20 09:30:07,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:07,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:07,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:30:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:07,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:30:07,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:07,623 INFO L85 PathProgramCache]: Analyzing trace with hash 770197175, now seen corresponding path program 1 times [2022-11-20 09:30:07,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:07,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325913341] [2022-11-20 09:30:07,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:07,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:07,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:07,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325913341] [2022-11-20 09:30:07,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325913341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:07,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:07,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:30:07,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880109600] [2022-11-20 09:30:07,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:07,752 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:30:07,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:07,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:07,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:07,754 INFO L87 Difference]: Start difference. First operand 342 states and 526 transitions. cyclomatic complexity: 192 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11-20 09:30:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:07,787 INFO L93 Difference]: Finished difference Result 674 states and 1026 transitions. [2022-11-20 09:30:07,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 1026 transitions. [2022-11-20 09:30:07,795 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2022-11-20 09:30:07,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 674 states and 1026 transitions. [2022-11-20 09:30:07,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2022-11-20 09:30:07,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2022-11-20 09:30:07,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 674 states and 1026 transitions. [2022-11-20 09:30:07,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:30:07,807 INFO L218 hiAutomatonCegarLoop]: Abstraction has 674 states and 1026 transitions. [2022-11-20 09:30:07,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states and 1026 transitions. [2022-11-20 09:30:07,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2022-11-20 09:30:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 674 states have (on average 1.5222551928783383) internal successors, (1026), 673 states have internal predecessors, (1026), 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-11-20 09:30:07,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1026 transitions. [2022-11-20 09:30:07,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 674 states and 1026 transitions. [2022-11-20 09:30:07,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:07,849 INFO L428 stractBuchiCegarLoop]: Abstraction has 674 states and 1026 transitions. [2022-11-20 09:30:07,849 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-20 09:30:07,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1026 transitions. [2022-11-20 09:30:07,855 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2022-11-20 09:30:07,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:30:07,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:30:07,856 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 09:30:07,856 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:07,857 INFO L748 eck$LassoCheckResult]: Stem: 2007#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 1989#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 1990#L211 [2022-11-20 09:30:07,857 INFO L750 eck$LassoCheckResult]: Loop: 1990#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2054#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 2055#L88 assume !(0 != main_~p1~0#1); 2248#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 2255#L92-1 assume !(0 != main_~p3~0#1); 2254#L96-1 assume !(0 != main_~p4~0#1); 2251#L100-1 assume !(0 != main_~p5~0#1); 2177#L104-1 assume !(0 != main_~p6~0#1); 2179#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2169#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2170#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2161#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2162#L124-1 assume !(0 != main_~p11~0#1); 2153#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2154#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2145#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2146#L140-1 assume !(0 != main_~p1~0#1); 2221#L146-1 assume 0 != main_~p2~0#1; 2218#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 2215#L151 assume !(0 != main_~p3~0#1); 2214#L156-1 assume !(0 != main_~p4~0#1); 2295#L161-1 assume !(0 != main_~p5~0#1); 2294#L166-1 assume !(0 != main_~p6~0#1); 2292#L171-1 assume !(0 != main_~p7~0#1); 2291#L176-1 assume !(0 != main_~p8~0#1); 2281#L181-1 assume !(0 != main_~p9~0#1); 2241#L186-1 assume !(0 != main_~p10~0#1); 2242#L191-1 assume !(0 != main_~p11~0#1); 2183#L196-1 assume !(0 != main_~p12~0#1); 2182#L201-1 assume !(0 != main_~p13~0#1); 2072#L206-1 assume 0 != main_~p14~0#1; 2066#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 1990#L211 [2022-11-20 09:30:07,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:07,858 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-11-20 09:30:07,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:07,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442432782] [2022-11-20 09:30:07,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:07,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:07,867 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:30:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:07,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:30:07,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:07,876 INFO L85 PathProgramCache]: Analyzing trace with hash 910745785, now seen corresponding path program 1 times [2022-11-20 09:30:07,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:07,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439063603] [2022-11-20 09:30:07,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:07,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:07,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:07,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:07,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439063603] [2022-11-20 09:30:07,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439063603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:07,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:07,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:30:07,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641152277] [2022-11-20 09:30:07,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:07,928 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:30:07,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:07,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:07,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:07,930 INFO L87 Difference]: Start difference. First operand 674 states and 1026 transitions. cyclomatic complexity: 368 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11-20 09:30:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:07,957 INFO L93 Difference]: Finished difference Result 1330 states and 2002 transitions. [2022-11-20 09:30:07,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2002 transitions. [2022-11-20 09:30:07,976 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2022-11-20 09:30:07,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 2002 transitions. [2022-11-20 09:30:07,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2022-11-20 09:30:07,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2022-11-20 09:30:07,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 2002 transitions. [2022-11-20 09:30:07,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:30:07,993 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2022-11-20 09:30:07,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 2002 transitions. [2022-11-20 09:30:08,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2022-11-20 09:30:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1330 states have (on average 1.5052631578947369) internal successors, (2002), 1329 states have internal predecessors, (2002), 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-11-20 09:30:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2002 transitions. [2022-11-20 09:30:08,043 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2022-11-20 09:30:08,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:08,045 INFO L428 stractBuchiCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2022-11-20 09:30:08,045 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-20 09:30:08,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 2002 transitions. [2022-11-20 09:30:08,055 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2022-11-20 09:30:08,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:30:08,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:30:08,057 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 09:30:08,057 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:08,057 INFO L748 eck$LassoCheckResult]: Stem: 4016#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 3998#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 3999#L211 [2022-11-20 09:30:08,058 INFO L750 eck$LassoCheckResult]: Loop: 3999#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 4129#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 4125#L88 assume !(0 != main_~p1~0#1); 4121#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 4117#L92-1 assume !(0 != main_~p3~0#1); 4110#L96-1 assume !(0 != main_~p4~0#1); 4102#L100-1 assume !(0 != main_~p5~0#1); 4094#L104-1 assume !(0 != main_~p6~0#1); 4088#L108-1 assume !(0 != main_~p7~0#1); 4084#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4082#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4080#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4078#L124-1 assume !(0 != main_~p11~0#1); 4075#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4076#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4229#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4068#L140-1 assume !(0 != main_~p1~0#1); 4062#L146-1 assume 0 != main_~p2~0#1; 4063#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 4219#L151 assume !(0 != main_~p3~0#1); 4211#L156-1 assume !(0 != main_~p4~0#1); 4203#L161-1 assume !(0 != main_~p5~0#1); 4198#L166-1 assume !(0 != main_~p6~0#1); 4193#L171-1 assume !(0 != main_~p7~0#1); 4190#L176-1 assume !(0 != main_~p8~0#1); 4186#L181-1 assume !(0 != main_~p9~0#1); 4180#L186-1 assume !(0 != main_~p10~0#1); 4164#L191-1 assume !(0 != main_~p11~0#1); 4160#L196-1 assume !(0 != main_~p12~0#1); 4146#L201-1 assume !(0 != main_~p13~0#1); 4140#L206-1 assume 0 != main_~p14~0#1; 4136#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 3999#L211 [2022-11-20 09:30:08,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:08,059 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-11-20 09:30:08,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:08,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649143598] [2022-11-20 09:30:08,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:08,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:08,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:30:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:08,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:30:08,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash 776732279, now seen corresponding path program 1 times [2022-11-20 09:30:08,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:08,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729452866] [2022-11-20 09:30:08,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:08,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:08,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729452866] [2022-11-20 09:30:08,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729452866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:08,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:08,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:30:08,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413325568] [2022-11-20 09:30:08,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:08,121 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:30:08,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:08,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:08,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:08,123 INFO L87 Difference]: Start difference. First operand 1330 states and 2002 transitions. cyclomatic complexity: 704 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11-20 09:30:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:08,157 INFO L93 Difference]: Finished difference Result 2626 states and 3906 transitions. [2022-11-20 09:30:08,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 3906 transitions. [2022-11-20 09:30:08,186 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2022-11-20 09:30:08,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 3906 transitions. [2022-11-20 09:30:08,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2022-11-20 09:30:08,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2022-11-20 09:30:08,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 3906 transitions. [2022-11-20 09:30:08,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:30:08,214 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2022-11-20 09:30:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 3906 transitions. [2022-11-20 09:30:08,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2022-11-20 09:30:08,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2626 states have (on average 1.4874333587204875) internal successors, (3906), 2625 states have internal predecessors, (3906), 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-11-20 09:30:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 3906 transitions. [2022-11-20 09:30:08,317 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2022-11-20 09:30:08,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:08,320 INFO L428 stractBuchiCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2022-11-20 09:30:08,325 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-20 09:30:08,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 3906 transitions. [2022-11-20 09:30:08,341 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2022-11-20 09:30:08,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:30:08,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:30:08,347 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 09:30:08,347 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:08,348 INFO L748 eck$LassoCheckResult]: Stem: 7981#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 7962#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 7963#L211 [2022-11-20 09:30:08,348 INFO L750 eck$LassoCheckResult]: Loop: 7963#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 8562#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 8560#L88 assume !(0 != main_~p1~0#1); 8559#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 8368#L92-1 assume !(0 != main_~p3~0#1); 8369#L96-1 assume !(0 != main_~p4~0#1); 8542#L100-1 assume !(0 != main_~p5~0#1); 8538#L104-1 assume !(0 != main_~p6~0#1); 8534#L108-1 assume !(0 != main_~p7~0#1); 8530#L112-1 assume !(0 != main_~p8~0#1); 8528#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8480#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8481#L124-1 assume !(0 != main_~p11~0#1); 8472#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8473#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8463#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8464#L140-1 assume !(0 != main_~p1~0#1); 8526#L146-1 assume 0 != main_~p2~0#1; 8525#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 8491#L151 assume !(0 != main_~p3~0#1); 8489#L156-1 assume !(0 != main_~p4~0#1); 8245#L161-1 assume !(0 != main_~p5~0#1); 8240#L166-1 assume !(0 != main_~p6~0#1); 8241#L171-1 assume !(0 != main_~p7~0#1); 8587#L176-1 assume !(0 != main_~p8~0#1); 8585#L181-1 assume !(0 != main_~p9~0#1); 8582#L186-1 assume !(0 != main_~p10~0#1); 8581#L191-1 assume !(0 != main_~p11~0#1); 8570#L196-1 assume !(0 != main_~p12~0#1); 8566#L201-1 assume !(0 != main_~p13~0#1); 8564#L206-1 assume 0 != main_~p14~0#1; 8563#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 7963#L211 [2022-11-20 09:30:08,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:08,354 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-11-20 09:30:08,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:08,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921326838] [2022-11-20 09:30:08,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:08,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:08,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:30:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:08,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:30:08,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:08,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1028706055, now seen corresponding path program 1 times [2022-11-20 09:30:08,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:08,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426974072] [2022-11-20 09:30:08,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:08,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:08,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:08,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426974072] [2022-11-20 09:30:08,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426974072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:08,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:08,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:30:08,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857202123] [2022-11-20 09:30:08,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:08,456 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:30:08,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:08,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:08,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:08,458 INFO L87 Difference]: Start difference. First operand 2626 states and 3906 transitions. cyclomatic complexity: 1344 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11-20 09:30:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:08,516 INFO L93 Difference]: Finished difference Result 5186 states and 7618 transitions. [2022-11-20 09:30:08,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5186 states and 7618 transitions. [2022-11-20 09:30:08,565 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2022-11-20 09:30:08,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5186 states to 5186 states and 7618 transitions. [2022-11-20 09:30:08,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5186 [2022-11-20 09:30:08,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5186 [2022-11-20 09:30:08,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5186 states and 7618 transitions. [2022-11-20 09:30:08,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:30:08,617 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2022-11-20 09:30:08,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states and 7618 transitions. [2022-11-20 09:30:08,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2022-11-20 09:30:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5186 states have (on average 1.4689548785190898) internal successors, (7618), 5185 states have internal predecessors, (7618), 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-11-20 09:30:08,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7618 transitions. [2022-11-20 09:30:08,833 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2022-11-20 09:30:08,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:08,837 INFO L428 stractBuchiCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2022-11-20 09:30:08,838 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-20 09:30:08,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5186 states and 7618 transitions. [2022-11-20 09:30:08,878 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2022-11-20 09:30:08,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:30:08,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:30:08,879 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 09:30:08,880 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:08,881 INFO L748 eck$LassoCheckResult]: Stem: 15797#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 15778#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 15779#L211 [2022-11-20 09:30:08,881 INFO L750 eck$LassoCheckResult]: Loop: 15779#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 16492#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 16493#L88 assume !(0 != main_~p1~0#1); 16478#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 16479#L92-1 assume !(0 != main_~p3~0#1); 16474#L96-1 assume !(0 != main_~p4~0#1); 16475#L100-1 assume !(0 != main_~p5~0#1); 16603#L104-1 assume !(0 != main_~p6~0#1); 16600#L108-1 assume !(0 != main_~p7~0#1); 16595#L112-1 assume !(0 != main_~p8~0#1); 16585#L116-1 assume !(0 != main_~p9~0#1); 16584#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 16583#L124-1 assume !(0 != main_~p11~0#1); 16582#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 16316#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 16317#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 16297#L140-1 assume !(0 != main_~p1~0#1); 16299#L146-1 assume 0 != main_~p2~0#1; 16208#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 16209#L151 assume !(0 != main_~p3~0#1); 16198#L156-1 assume !(0 != main_~p4~0#1); 16199#L161-1 assume !(0 != main_~p5~0#1); 16188#L166-1 assume !(0 != main_~p6~0#1); 16189#L171-1 assume !(0 != main_~p7~0#1); 16575#L176-1 assume !(0 != main_~p8~0#1); 16627#L181-1 assume !(0 != main_~p9~0#1); 16625#L186-1 assume !(0 != main_~p10~0#1); 16624#L191-1 assume !(0 != main_~p11~0#1); 16622#L196-1 assume !(0 != main_~p12~0#1); 16521#L201-1 assume !(0 != main_~p13~0#1); 16520#L206-1 assume 0 != main_~p14~0#1; 16508#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 15779#L211 [2022-11-20 09:30:08,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:08,882 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-11-20 09:30:08,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:08,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827353988] [2022-11-20 09:30:08,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:08,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:08,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:30:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:08,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:30:08,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:08,915 INFO L85 PathProgramCache]: Analyzing trace with hash -809851337, now seen corresponding path program 1 times [2022-11-20 09:30:08,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:08,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032057103] [2022-11-20 09:30:08,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:08,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:08,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:08,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032057103] [2022-11-20 09:30:08,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032057103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:08,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:08,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:30:08,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022869340] [2022-11-20 09:30:08,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:08,963 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:30:08,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:08,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:08,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:08,965 INFO L87 Difference]: Start difference. First operand 5186 states and 7618 transitions. cyclomatic complexity: 2560 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11-20 09:30:09,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:09,053 INFO L93 Difference]: Finished difference Result 10242 states and 14850 transitions. [2022-11-20 09:30:09,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10242 states and 14850 transitions. [2022-11-20 09:30:09,204 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2022-11-20 09:30:09,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10242 states to 10242 states and 14850 transitions. [2022-11-20 09:30:09,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10242 [2022-11-20 09:30:09,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10242 [2022-11-20 09:30:09,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10242 states and 14850 transitions. [2022-11-20 09:30:09,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:30:09,301 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2022-11-20 09:30:09,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states and 14850 transitions. [2022-11-20 09:30:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10242. [2022-11-20 09:30:09,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10242 states, 10242 states have (on average 1.4499121265377857) internal successors, (14850), 10241 states have internal predecessors, (14850), 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-11-20 09:30:09,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 14850 transitions. [2022-11-20 09:30:09,647 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2022-11-20 09:30:09,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:09,651 INFO L428 stractBuchiCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2022-11-20 09:30:09,652 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-20 09:30:09,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10242 states and 14850 transitions. [2022-11-20 09:30:09,704 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2022-11-20 09:30:09,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:30:09,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:30:09,706 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 09:30:09,707 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:09,707 INFO L748 eck$LassoCheckResult]: Stem: 31232#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 31212#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 31213#L211 [2022-11-20 09:30:09,709 INFO L750 eck$LassoCheckResult]: Loop: 31213#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 31584#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 31585#L88 assume !(0 != main_~p1~0#1); 31684#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 31683#L92-1 assume !(0 != main_~p3~0#1); 31681#L96-1 assume !(0 != main_~p4~0#1); 31679#L100-1 assume !(0 != main_~p5~0#1); 31677#L104-1 assume !(0 != main_~p6~0#1); 31675#L108-1 assume !(0 != main_~p7~0#1); 31671#L112-1 assume !(0 != main_~p8~0#1); 31667#L116-1 assume !(0 != main_~p9~0#1); 31664#L120-1 assume !(0 != main_~p10~0#1); 31662#L124-1 assume !(0 != main_~p11~0#1); 31660#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 31658#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 31656#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 31654#L140-1 assume !(0 != main_~p1~0#1); 31652#L146-1 assume 0 != main_~p2~0#1; 31650#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 31647#L151 assume !(0 != main_~p3~0#1); 31642#L156-1 assume !(0 != main_~p4~0#1); 31638#L161-1 assume !(0 != main_~p5~0#1); 31634#L166-1 assume !(0 != main_~p6~0#1); 31630#L171-1 assume !(0 != main_~p7~0#1); 31626#L176-1 assume !(0 != main_~p8~0#1); 31622#L181-1 assume !(0 != main_~p9~0#1); 31623#L186-1 assume !(0 != main_~p10~0#1); 31614#L191-1 assume !(0 != main_~p11~0#1); 31613#L196-1 assume !(0 != main_~p12~0#1); 31602#L201-1 assume !(0 != main_~p13~0#1); 31601#L206-1 assume 0 != main_~p14~0#1; 31592#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 31213#L211 [2022-11-20 09:30:09,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:09,710 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-11-20 09:30:09,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:09,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327178664] [2022-11-20 09:30:09,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:09,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:09,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:30:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:09,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:30:09,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:09,739 INFO L85 PathProgramCache]: Analyzing trace with hash -387149511, now seen corresponding path program 1 times [2022-11-20 09:30:09,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:09,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023044842] [2022-11-20 09:30:09,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:09,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:09,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:09,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:09,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023044842] [2022-11-20 09:30:09,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023044842] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:09,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:09,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:30:09,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250630418] [2022-11-20 09:30:09,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:09,793 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:30:09,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:09,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:09,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:09,794 INFO L87 Difference]: Start difference. First operand 10242 states and 14850 transitions. cyclomatic complexity: 4864 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11-20 09:30:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:09,948 INFO L93 Difference]: Finished difference Result 20226 states and 28930 transitions. [2022-11-20 09:30:09,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20226 states and 28930 transitions. [2022-11-20 09:30:10,184 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2022-11-20 09:30:10,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20226 states to 20226 states and 28930 transitions. [2022-11-20 09:30:10,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20226 [2022-11-20 09:30:10,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20226 [2022-11-20 09:30:10,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20226 states and 28930 transitions. [2022-11-20 09:30:10,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:30:10,527 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2022-11-20 09:30:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states and 28930 transitions. [2022-11-20 09:30:11,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20226. [2022-11-20 09:30:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20226 states, 20226 states have (on average 1.43033718975576) internal successors, (28930), 20225 states have internal predecessors, (28930), 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-11-20 09:30:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 28930 transitions. [2022-11-20 09:30:11,150 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2022-11-20 09:30:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:11,153 INFO L428 stractBuchiCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2022-11-20 09:30:11,153 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-20 09:30:11,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20226 states and 28930 transitions. [2022-11-20 09:30:11,234 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2022-11-20 09:30:11,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:30:11,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:30:11,236 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 09:30:11,236 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:11,236 INFO L748 eck$LassoCheckResult]: Stem: 61707#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 61687#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 61688#L211 [2022-11-20 09:30:11,236 INFO L750 eck$LassoCheckResult]: Loop: 61688#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 61838#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 61836#L88 assume !(0 != main_~p1~0#1); 61834#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 61832#L92-1 assume !(0 != main_~p3~0#1); 61828#L96-1 assume !(0 != main_~p4~0#1); 61824#L100-1 assume !(0 != main_~p5~0#1); 61820#L104-1 assume !(0 != main_~p6~0#1); 61816#L108-1 assume !(0 != main_~p7~0#1); 61812#L112-1 assume !(0 != main_~p8~0#1); 61808#L116-1 assume !(0 != main_~p9~0#1); 61804#L120-1 assume !(0 != main_~p10~0#1); 61802#L124-1 assume !(0 != main_~p11~0#1); 61798#L128-1 assume !(0 != main_~p12~0#1); 61796#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 61794#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 61792#L140-1 assume !(0 != main_~p1~0#1); 61787#L146-1 assume 0 != main_~p2~0#1; 61784#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 61780#L151 assume !(0 != main_~p3~0#1); 61779#L156-1 assume !(0 != main_~p4~0#1); 61877#L161-1 assume !(0 != main_~p5~0#1); 61873#L166-1 assume !(0 != main_~p6~0#1); 61869#L171-1 assume !(0 != main_~p7~0#1); 61865#L176-1 assume !(0 != main_~p8~0#1); 61861#L181-1 assume !(0 != main_~p9~0#1); 61857#L186-1 assume !(0 != main_~p10~0#1); 61854#L191-1 assume !(0 != main_~p11~0#1); 61849#L196-1 assume !(0 != main_~p12~0#1); 61846#L201-1 assume !(0 != main_~p13~0#1); 61843#L206-1 assume 0 != main_~p14~0#1; 61841#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 61688#L211 [2022-11-20 09:30:11,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:11,237 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-11-20 09:30:11,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:11,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49294724] [2022-11-20 09:30:11,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:11,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:11,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:30:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:11,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:30:11,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:11,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2076093253, now seen corresponding path program 1 times [2022-11-20 09:30:11,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:11,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136969612] [2022-11-20 09:30:11,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:11,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:11,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:11,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:11,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136969612] [2022-11-20 09:30:11,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136969612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:11,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:11,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:30:11,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642960805] [2022-11-20 09:30:11,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:11,317 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:30:11,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:11,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:11,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:11,319 INFO L87 Difference]: Start difference. First operand 20226 states and 28930 transitions. cyclomatic complexity: 9216 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11-20 09:30:11,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:11,573 INFO L93 Difference]: Finished difference Result 39938 states and 56322 transitions. [2022-11-20 09:30:11,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39938 states and 56322 transitions. [2022-11-20 09:30:11,934 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2022-11-20 09:30:12,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39938 states to 39938 states and 56322 transitions. [2022-11-20 09:30:12,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39938 [2022-11-20 09:30:12,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39938 [2022-11-20 09:30:12,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39938 states and 56322 transitions. [2022-11-20 09:30:12,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:30:12,276 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2022-11-20 09:30:12,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states and 56322 transitions. [2022-11-20 09:30:12,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 39938. [2022-11-20 09:30:12,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39938 states, 39938 states have (on average 1.4102358655916671) internal successors, (56322), 39937 states have internal predecessors, (56322), 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-11-20 09:30:13,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39938 states to 39938 states and 56322 transitions. [2022-11-20 09:30:13,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2022-11-20 09:30:13,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:13,422 INFO L428 stractBuchiCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2022-11-20 09:30:13,422 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-20 09:30:13,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39938 states and 56322 transitions. [2022-11-20 09:30:13,729 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2022-11-20 09:30:13,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:30:13,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:30:13,731 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 09:30:13,731 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:13,732 INFO L748 eck$LassoCheckResult]: Stem: 121873#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 121856#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 121857#L211 [2022-11-20 09:30:13,732 INFO L750 eck$LassoCheckResult]: Loop: 121857#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 122287#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 122283#L88 assume !(0 != main_~p1~0#1); 122281#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 122279#L92-1 assume !(0 != main_~p3~0#1); 122275#L96-1 assume !(0 != main_~p4~0#1); 122271#L100-1 assume !(0 != main_~p5~0#1); 122267#L104-1 assume !(0 != main_~p6~0#1); 122263#L108-1 assume !(0 != main_~p7~0#1); 122259#L112-1 assume !(0 != main_~p8~0#1); 122255#L116-1 assume !(0 != main_~p9~0#1); 122251#L120-1 assume !(0 != main_~p10~0#1); 122249#L124-1 assume !(0 != main_~p11~0#1); 122246#L128-1 assume !(0 != main_~p12~0#1); 122247#L132-1 assume !(0 != main_~p13~0#1); 122340#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 122337#L140-1 assume !(0 != main_~p1~0#1); 122335#L146-1 assume 0 != main_~p2~0#1; 122332#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 122329#L151 assume !(0 != main_~p3~0#1); 122324#L156-1 assume !(0 != main_~p4~0#1); 122320#L161-1 assume !(0 != main_~p5~0#1); 122316#L166-1 assume !(0 != main_~p6~0#1); 122312#L171-1 assume !(0 != main_~p7~0#1); 122308#L176-1 assume !(0 != main_~p8~0#1); 122304#L181-1 assume !(0 != main_~p9~0#1); 122300#L186-1 assume !(0 != main_~p10~0#1); 122298#L191-1 assume !(0 != main_~p11~0#1); 122296#L196-1 assume !(0 != main_~p12~0#1); 122294#L201-1 assume !(0 != main_~p13~0#1); 122292#L206-1 assume 0 != main_~p14~0#1; 122290#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 121857#L211 [2022-11-20 09:30:13,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:13,733 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2022-11-20 09:30:13,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:13,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591766227] [2022-11-20 09:30:13,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:13,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:13,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:30:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:13,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:30:13,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:13,746 INFO L85 PathProgramCache]: Analyzing trace with hash 224729337, now seen corresponding path program 1 times [2022-11-20 09:30:13,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:13,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785902989] [2022-11-20 09:30:13,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:13,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:13,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:30:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:13,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:30:13,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:13,769 INFO L85 PathProgramCache]: Analyzing trace with hash -233466693, now seen corresponding path program 1 times [2022-11-20 09:30:13,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:13,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396999357] [2022-11-20 09:30:13,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:13,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:13,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:30:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:13,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:30:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:14,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:30:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:14,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 09:30:14 BoogieIcfgContainer [2022-11-20 09:30:14,687 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-20 09:30:14,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:30:14,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:30:14,689 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:30:14,690 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:30:06" (3/4) ... [2022-11-20 09:30:14,693 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-11-20 09:30:14,755 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 09:30:14,756 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:30:14,757 INFO L158 Benchmark]: Toolchain (without parser) took 9636.98ms. Allocated memory was 117.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 74.5MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 322.1MB. Max. memory is 16.1GB. [2022-11-20 09:30:14,757 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 117.4MB. Free memory is still 93.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:30:14,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.73ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 63.0MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 09:30:14,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.45ms. Allocated memory is still 117.4MB. Free memory was 63.0MB in the beginning and 61.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:30:14,759 INFO L158 Benchmark]: Boogie Preprocessor took 28.97ms. Allocated memory is still 117.4MB. Free memory was 61.3MB in the beginning and 59.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:30:14,759 INFO L158 Benchmark]: RCFGBuilder took 745.36ms. Allocated memory was 117.4MB in the beginning and 146.8MB in the end (delta: 29.4MB). Free memory was 59.8MB in the beginning and 113.0MB in the end (delta: -53.2MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2022-11-20 09:30:14,760 INFO L158 Benchmark]: BuchiAutomizer took 8412.84ms. Allocated memory was 146.8MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 113.0MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 325.0MB. Max. memory is 16.1GB. [2022-11-20 09:30:14,760 INFO L158 Benchmark]: Witness Printer took 67.72ms. Allocated memory is still 2.2GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 09:30:14,763 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.34ms. Allocated memory is still 117.4MB. Free memory is still 93.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.73ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 63.0MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.45ms. Allocated memory is still 117.4MB. Free memory was 63.0MB in the beginning and 61.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.97ms. Allocated memory is still 117.4MB. Free memory was 61.3MB in the beginning and 59.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 745.36ms. Allocated memory was 117.4MB in the beginning and 146.8MB in the end (delta: 29.4MB). Free memory was 59.8MB in the beginning and 113.0MB in the end (delta: -53.2MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 8412.84ms. Allocated memory was 146.8MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 113.0MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 325.0MB. Max. memory is 16.1GB. * Witness Printer took 67.72ms. Allocated memory is still 2.2GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 39938 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.1s. Büchi inclusion checks took 5.1s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 2.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.4s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 551 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 551 mSDsluCounter, 1762 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 679 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 1083 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI10 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 53]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; Loop: [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND TRUE p2 != 0 [L93] lk2 = 1 [L96] COND FALSE !(p3 != 0) [L100] COND FALSE !(p4 != 0) [L104] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L112] COND FALSE !(p7 != 0) [L116] COND FALSE !(p8 != 0) [L120] COND FALSE !(p9 != 0) [L124] COND FALSE !(p10 != 0) [L128] COND FALSE !(p11 != 0) [L132] COND FALSE !(p12 != 0) [L136] COND FALSE !(p13 != 0) [L140] COND TRUE p14 != 0 [L141] lk14 = 1 [L146] COND FALSE !(p1 != 0) [L151] COND TRUE p2 != 0 [L152] COND FALSE !(lk2 != 1) [L153] lk2 = 0 [L156] COND FALSE !(p3 != 0) [L161] COND FALSE !(p4 != 0) [L166] COND FALSE !(p5 != 0) [L171] COND FALSE !(p6 != 0) [L176] COND FALSE !(p7 != 0) [L181] COND FALSE !(p8 != 0) [L186] COND FALSE !(p9 != 0) [L191] COND FALSE !(p10 != 0) [L196] COND FALSE !(p11 != 0) [L201] COND FALSE !(p12 != 0) [L206] COND FALSE !(p13 != 0) [L211] COND TRUE p14 != 0 [L212] COND FALSE !(lk14 != 1) [L213] lk14 = 0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 53]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; Loop: [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND TRUE p2 != 0 [L93] lk2 = 1 [L96] COND FALSE !(p3 != 0) [L100] COND FALSE !(p4 != 0) [L104] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L112] COND FALSE !(p7 != 0) [L116] COND FALSE !(p8 != 0) [L120] COND FALSE !(p9 != 0) [L124] COND FALSE !(p10 != 0) [L128] COND FALSE !(p11 != 0) [L132] COND FALSE !(p12 != 0) [L136] COND FALSE !(p13 != 0) [L140] COND TRUE p14 != 0 [L141] lk14 = 1 [L146] COND FALSE !(p1 != 0) [L151] COND TRUE p2 != 0 [L152] COND FALSE !(lk2 != 1) [L153] lk2 = 0 [L156] COND FALSE !(p3 != 0) [L161] COND FALSE !(p4 != 0) [L166] COND FALSE !(p5 != 0) [L171] COND FALSE !(p6 != 0) [L176] COND FALSE !(p7 != 0) [L181] COND FALSE !(p8 != 0) [L186] COND FALSE !(p9 != 0) [L191] COND FALSE !(p10 != 0) [L196] COND FALSE !(p11 != 0) [L201] COND FALSE !(p12 != 0) [L206] COND FALSE !(p13 != 0) [L211] COND TRUE p14 != 0 [L212] COND FALSE !(lk14 != 1) [L213] lk14 = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-11-20 09:30:14,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05a2c2e2-bf5f-482e-8a62-6dd424fbe6b1/bin/uautomizer-ug76WZFUDN/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)